David Amsallem
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
David Amsallem has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
Charbel Farhat
Department of Aeronautics and Astronautics Stanford University Stanford California 94305 U.S.A.
4 shared publications- Charbel Farhat
Stanford University
3 shared publications Bernard Haasdonk
Institute for Applied Analysis and Numerical Simulation, University of Stuttgart
2 shared publications- Jan Nordström
Department of Mathematics Linköping University Linköping Sweden
2 shared publications - Matthew J. Zahr
University of Notre Dame
2 shared publications A. Paul‐Dubois‐Taine
Department of Aeronautics and Astronautics Stanford University Stanford, CA 94305 Mail Code 4035 USA
1 shared publication
Latest Publications
- Open Access
- 6 March 2016
- Published by Springer Nature in Advanced Modeling and Simulation in Engineering Sciences
- Vol. 3 (1) , 1
PEBL-ROM: Projection-error based local reduced-order models
- 6 March 2016
- Published by Springer Nature in Advanced Modeling and Simulation in Engineering Sciences
- Vol. 3 (1) , 1
Open AccessPEBL-ROM: Projection-error based local reduced-order models
- Open Access
Real-time solution of computational problems using databases of parametric linear reduced-order models with arbitrary underlying meshes
A comprehensive approach for real-time computations using a database of parameterized linear reduced-order models (ROMs) is proposed. The method proceeds by sampling offline ROMs for specific values of the parameters and interpolating online the associated reduced operators. In the offline phase, a pre-processing step transforms the reduced operators into consistent sets of generalized coordinates prior to their interpolation. The present paper also introduces a consistency enforcement approach for models defined on arbitrary underlying meshes. In the online phase, the operators are interpolated on matrix manifolds. The proposed framework is illustrated on two realistic multi-physics problems: an inverse acoustic scattering problem around a submarine and flutter predictions for a wing-tank system. The second application is implemented on a mobile device, illustrating the capability of the proposed framework to operate in real-time.
Open AccessReal-time solution of computational problems using databases of parametric linear reduced-order models with arbitrary underlying meshes
A comprehensive approach for real-time computations using a database of parameterized linear reduced-order models (ROMs) is proposed. The method proceeds by sampling offline ROMs for specific values of the parameters and interpolating online the associated reduced operators. In the offline phase, a pre-processing step transforms the reduced operators into consistent sets of generalized coordinates prior to their interpolation. The present paper also introduces a consistency enforcement approach for models defined on arbitrary underlying meshes. In the online phase, the operators are interpolated on matrix manifolds. The proposed framework is illustrated on two realistic multi-physics problems: an inverse acoustic scattering problem around a submarine and flutter predictions for a wing-tank system. The second application is implemented on a mobile device, illustrating the capability of the proposed framework to operate in real-time.
- Open Access
- 27 February 2015
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 102 (5) , 931-932
Special Issue on Model Reduction
- 27 February 2015
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 102 (5) , 931-932
Open AccessSpecial Issue on Model Reduction
- 15 February 2015
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 41 (5) , 1187-1230
Fast local reduced basis updates for the efficient reduction of nonlinear systems with hyper-reduction
- 15 February 2015
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 41 (5) , 1187-1230
Fast local reduced basis updates for the efficient reduction of nonlinear systems with hyper-reduction
- 1 November 2014
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 51 (4) , 919-940
Design optimization using hyper-reduced-order models
- 1 November 2014
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 51 (4) , 919-940
Design optimization using hyper-reduced-order models
- Top Cited Papers
- 24 September 2014
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 102 (5) , 1262-1292
An adaptive and efficient greedy procedure for the optimal training of parametric reduced‐order models
Summary: An adaptive and efficient approach for constructing reduced‐order models (ROMs) that are robust to changes in parameters is developed. The approach is based on a greedy sampling of the underlying high‐dimensional model (HDM) together with an efficient procedure for exploring the configuration space and identifying parameters for which the error is likely to be high. Because this exploration is based on a surrogate model for an error indicator, it is amenable to a fast training phase. Furthermore, a model for the exact error based on the error indicator is constructed and used to determine when the greedy procedure reaches a desired error tolerance. An efficient procedure for updating the reduced‐order basis constructed by proper orthogonal decomposition is also introduced in this paper, avoiding the cost associated with computing large‐scale singular value decompositions. The proposed procedure is then shown to require less evaluations of a posteriori error estimators than the classical procedure in order to identify locations of the parameter space to be sampled. It is illustrated on the training of parametric ROMs for three linear and nonlinear mechanical systems, including the realistic prediction of the response of a V‐hull vehicle to underbody blasts. Copyright © 2014 John Wiley & Sons, Ltd.
- 24 September 2014
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 102 (5) , 1262-1292
Top Cited PapersAn adaptive and efficient greedy procedure for the optimal training of parametric reduced‐order models
Summary: An adaptive and efficient approach for constructing reduced‐order models (ROMs) that are robust to changes in parameters is developed. The approach is based on a greedy sampling of the underlying high‐dimensional model (HDM) together with an efficient procedure for exploring the configuration space and identifying parameters for which the error is likely to be high. Because this exploration is based on a surrogate model for an error indicator, it is amenable to a fast training phase. Furthermore, a model for the exact error based on the error indicator is constructed and used to determine when the greedy procedure reaches a desired error tolerance. An efficient procedure for updating the reduced‐order basis constructed by proper orthogonal decomposition is also introduced in this paper, avoiding the cost associated with computing large‐scale singular value decompositions. The proposed procedure is then shown to require less evaluations of a posteriori error estimators than the classical procedure in order to identify locations of the parameter space to be sampled. It is illustrated on the training of parametric ROMs for three linear and nonlinear mechanical systems, including the realistic prediction of the response of a V‐hull vehicle to underbody blasts. Copyright © 2014 John Wiley & Sons, Ltd.
- 18 December 2013
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 48 (1) , 135-163
Error estimates for Galerkin reduced-order models of the semi-discrete wave equation
Galerkin reduced-order models for the semi-discrete wave equation, that preserve the second-order structure, are studied. Error bounds for the full state variables are derived in the continuous setting (when the whole trajectory is known) and in the discrete setting when the Newmark average-acceleration scheme is used on the second-order semi-discrete equation. When the approximating subspace is constructed using the proper orthogonal decomposition, the error estimates are proportional to the sums of the neglected singular values. Numerical experiments illustrate the theoretical results.
- 18 December 2013
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 48 (1) , 135-163
Error estimates for Galerkin reduced-order models of the semi-discrete wave equation
Galerkin reduced-order models for the semi-discrete wave equation, that preserve the second-order structure, are studied. Error bounds for the full state variables are derived in the continuous setting (when the whole trajectory is known) and in the discrete setting when the Newmark average-acceleration scheme is used on the second-order semi-discrete equation. When the approximating subspace is constructed using the proper orthogonal decomposition, the error estimates are proportional to the sums of the neglected singular values. Numerical experiments illustrate the theoretical results.
- 1 November 2013
- Published by Elsevier in Journal of Computational Physics
- Vol. 252, 573-590
High-order accurate difference schemes for the Hodgkin–Huxley equations
- 1 November 2013
- Published by Elsevier in Journal of Computational Physics
- Vol. 252, 573-590
High-order accurate difference schemes for the Hodgkin–Huxley equations
- Open Access
High-order accurate difference schemes for the Hodgkin-Huxley equations
A novel approach for simulating potential propagation in neuronal branches with high accuracy is developed. The method relies on high-order accurate difference schemes using the Summation-By-Parts operators with weak boundary and interface conditions applied to the Hodgkin-Huxley equations. This work is the first demonstrating high accuracy for that equation. Several boundary conditions are considered including the non-standard one accounting for the soma presence, which is characterized by its own partial differential equation. Well-posedness for the continuous problem as well as stability of the discrete approximation is proved for all the boundary conditions. Gains in terms of CPU times are observed when high-order operators are used, demonstrating the advantage of the high-order schemes for simulating potential propagation in large neuronal trees.
Open AccessHigh-order accurate difference schemes for the Hodgkin-Huxley equations
A novel approach for simulating potential propagation in neuronal branches with high accuracy is developed. The method relies on high-order accurate difference schemes using the Summation-By-Parts operators with weak boundary and interface conditions applied to the Hodgkin-Huxley equations. This work is the first demonstrating high accuracy for that equation. Several boundary conditions are considered including the non-standard one accounting for the soma presence, which is characterized by its own partial differential equation. Well-posedness for the continuous problem as well as stability of the discrete approximation is proved for all the boundary conditions. Gains in terms of CPU times are observed when high-order operators are used, demonstrating the advantage of the high-order schemes for simulating potential propagation in large neuronal trees.