Reduced collocation methods: Reduced basis methods in the collocation framework
From MaRDI portal
Abstract: In this paper, we present the first reduced basis method well-suited for the collocation framework. Two fundamentally different algorithms are presented: the so-called Least Squares Reduced Collocation Method (LSRCM) and Empirical Reduced Collocation Method (ERCM). This work provides a reduced basis strategy to practitioners who {prefer} a collocation, rather than Galerkin, approach. Furthermore, the empirical reduced collocation method eliminates a potentially costly online procedure that is needed for non-affine problems with Galerkin approach. Numerical results demonstrate the high efficiency and accuracy of the reduced collocation methods, which match or exceed that of the traditional reduced basis method in the Galerkin framework.
Recommendations
- Reduced collocation method for time-dependent parametrized partial differential equations
- Reduced Basis Collocation Methods for Partial Differential Equations with Random Coefficients
- Reduced basis methods for uncertainty quantification
- 4 Reduced basis methods
- On the Error Behavior of the Reduced Basis Technique for Nonlinear Finite Element Approximations
Cites work
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
- A monotonic evaluation of lower bounds for inf-sup stability constants in the frame of reduced basis approximations
- A natural-norm successive constraint method for inf-sup lower bounds
- A priori convergence theory for reduced-basis approximations of single-parameter elliptic partial differential equations
- A successive constraint linear optimization method for lower bounds of parametric coercivity and inf-sup stability constants
- A ‘best points’ interpolation method for efficient approximation of parametrized functions
- Accelerated a posteriori error estimation for the reduced basis method with application to 3D electromagnetic scattering problems
- An `empirical interpolation' method: Application to efficient reduced-basis discretization of partial differential equations
- Certified reduced basis method for electromagnetic scattering and radar cross section estimation
- Certified reduced basis methods and output bounds for the harmonic Maxwell's equations
- Convergence rates for greedy algorithms in reduced basis methods
- Efficient reduced-basis treatment of nonaffine and nonlinear partial differential equations
- Modal representation of geometrically nonlinear behavior by the finite element method
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- Spectral and high-order methods with applications.
- Spectral Methods for Time-Dependent Problems
- Spectral Methods in MATLAB
Cited in
(15)- Reduced basis decomposition: a certified and fast lossy data compression algorithm
- A ROM-accelerated parallel-in-time preconditioner for solving all-at-once systems in unsteady convection-diffusion PDEs
- An efficient QSC approximation of variable-order time-fractional mobile-immobile diffusion equations with variably diffusive coefficients
- An EIM-degradation free reduced basis method via over collocation and residual hyper reduction-based error estimation
- A hyper-reduced MAC scheme for the parametric Stokes and Navier-Stokes equations
- Certified offline-free reduced basis (COFRB) methods for stochastic differential equations driven by arbitrary types of noise
- Reduced collocation method for time-dependent parametrized partial differential equations
- A reduced radial basis function method for partial differential equations on irregular domains
- A goal-oriented reduced basis methods-accelerated generalized polynomial chaos algorithm
- Parametric analytical preconditioning and its applications to the reduced collocation methods
- 4 Reduced basis methods
- Fast \(L^2\) optimal mass transport via reduced basis methods for the Monge-Ampère equation
- Adaptive greedy algorithms based on parameter-domain decomposition and reconstruction for the reduced basis method
- A certified reduced-order framework based on Legendre collocation for a Rayleigh-Bénard problem
- A reduced basis decomposition approach to efficient data collection in pairwise comparison studies
This page was built for publication: Reduced collocation methods: Reduced basis methods in the collocation framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955927)
