Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2016
DOI: 10.1002/fld.4260
|View full text |Cite
|
Sign up to set email alerts
|

Efficient approximation of Sparse Jacobians for time‐implicit reduced order models

Abstract: Summary This paper introduces a sparse matrix discrete interpolation method to effectively compute matrix approximations in the reduced order modeling framework. The sparse algorithm developed herein relies on the discrete empirical interpolation method and uses only samples of the nonzero entries of the matrix series. The proposed approach can approximate very large matrices, unlike the current matrix discrete empirical interpolation method, which is limited by its large computational memory requirements. The… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
13
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(13 citation statements)
references
References 87 publications
0
13
0
Order By: Relevance
“…Furthermore, alternative approximations of the system tangent, e.g. [5,29,38], could be investigated. Yet some of these methods require additional high dimensional snapshots of the sparse system tangent which becomes computational infeasible rapidly.…”
Section: Resultsmentioning
confidence: 99%
“…Furthermore, alternative approximations of the system tangent, e.g. [5,29,38], could be investigated. Yet some of these methods require additional high dimensional snapshots of the sparse system tangent which becomes computational infeasible rapidly.…”
Section: Resultsmentioning
confidence: 99%
“…We can refer to other works [23][24][25][26] for basic concepts in the POD method, [27][28][29][30][31][32] for using POD technique on numerical solution of PDEs, 33 for application of POD in PDE optimal control, 34-37 for error estimation of the POD method for optimal control problems and to previous studies [38][39][40][41][42][43][44] for other engineering applications. This method generates an optimal set of basis functions (so-called POD basis functions) where each of them has a global support and involves information about the system obtained out of a computational or experimental database (snapshots).…”
Section: Introductionmentioning
confidence: 99%
“…After this, the solution is obtained as a linear combination of the POD basis functions by means of Galerkin projection method. We can refer to other works [23][24][25][26] for basic concepts in the POD method, [27][28][29][30][31][32] for using POD technique on numerical solution of PDEs, 33 for application of POD in PDE optimal control, [34][35][36][37] for error estimation of the POD method for optimal control problems and to previous studies [38][39][40][41][42][43][44] for other engineering applications.…”
Section: Introductionmentioning
confidence: 99%
“…Ballarin and Rozza make use of POD‐Galerkin and reduced basis methods to develop a novel reduced order modeling framework for fluid–structure interaction problems with prescribed boundary motion using efficient geometrical techniques. Stefanescu and Sandu propose a sparse matrix discrete interpolation method to efficiently compute matrix approximations in the reduced order modeling framework. Bistrian and Navon focus on a difficult task in hydrodynamic stability analysis by modeling the dynamics of swirl intense flows.…”
mentioning
confidence: 99%