Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Phipps, Eric T."'
The Tucker decomposition, an extension of singular value decomposition for higher-order tensors, is a useful tool in analysis and compression of large-scale scientific data. While it has been studied extensively for static datasets, there are relativ
Externí odkaz:
http://arxiv.org/abs/2308.16395
In this work, solvers and preconditioners based on Gauss-Seidel and Jacobi algorithms are explored for stochastic Galerkin discretization of partial differential equations (PDEs) with random input data. Gauss-Seidel and Jacobi algorithms are formulat
Externí odkaz:
http://arxiv.org/abs/1904.06583
Publikováno v:
In Computer Methods in Applied Mechanics and Engineering 1 September 2020 369
We consider a multiphysics system with multiple component models coupled together through network coupling interfaces, i.e., a handful of scalars. If each component model contains uncertainties represented by a set of parameters, a straightfoward unc
Externí odkaz:
http://arxiv.org/abs/1308.6520
Autor:
Pawlowski, Roger P., Phipps, Eric T., Salinger, Andrew G., Owen, Steven J., Siefert, Christopher M., Staten, Matthew L.
A template-based generic programming approach was presented in a previous paper that separates the development effort of programming a physical model from that of computing additional quantities, such as derivatives, needed for embedded analysis algo
Externí odkaz:
http://arxiv.org/abs/1205.3952
Publikováno v:
Numerical Linear Algebra with Applications 21(1), 136-151, 2014
Use of the stochastic Galerkin finite element methods leads to large systems of linear equations obtained by the discretization of tensor product solution spaces along their spatial and stochastic dimensions. These systems are typically solved iterat
Externí odkaz:
http://arxiv.org/abs/1205.1864
An approach for incorporating embedded simulation and analysis capabilities in complex simulation codes through template-based generic programming is presented. This approach relies on templating and operator overloading within the C++ language to tr
Externí odkaz:
http://arxiv.org/abs/1205.0790
Autor:
Constantine, Paul G., Phipps, Eric T.
We seek to approximate a composite function h(x) = g(f(x)) with a global polynomial. The standard approach chooses points x in the domain of f and computes h(x) at each point, which requires an evaluation of f and an evaluation of g. We present a Lan
Externí odkaz:
http://arxiv.org/abs/1110.0058
Multivariate global polynomial approximations - such as polynomial chaos or stochastic collocation methods - are now in widespread use for sensitivity analysis and uncertainty quantification. The pseudospectral variety of these methods uses a numeric
Externí odkaz:
http://arxiv.org/abs/1109.2936
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.