A certified natural-norm successive constraint method for parametric inf-sup lower bounds
From MaRDI portal
(Redirected from Publication:891690)
linear programmingdomain decompositioninf-sup conditionreduced basis methodsuccessive constraint method
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Abstract: We present a certified version of the Natural-Norm Successive Constraint Method (cNNSCM) for fast and accurate Inf-Sup lower bound evaluation of parametric operators. Successive Constraint Methods (SCM) are essential tools for the construction of a lower bound for the inf-sup stability constants which are required in {it a posteriori} error analysis of reduced basis approximations. They utilize a Linear Program (LP) relaxation scheme incorporating continuity and stability constraints. The natural-norm approach {em linearizes} inf-sup constant as a function of the parameter. The Natural-Norm Successive Constraint Method (NNSCM) combines these two aspects. It uses a greedy algorithm to select SCM control points which adaptively construct an optimal decomposition of the parameter domain, and then apply the SCM on each domain. Unfortunately, the NNSCM produces no guarantee for the quality of the lower bound. The new cNNSCM provides an upper bound in addition to the lower bound and let the user control the gap, thus the quality of the lower bound. The efficacy and accuracy of the new method is validated by numerical experiments.
Recommendations
- A natural-norm successive constraint method for inf-sup lower bounds
- A successive constraint linear optimization method for lower bounds of parametric coercivity and inf-sup stability constants
- scientific article; zbMATH DE number 1399483
- Computable bounds on parametric solutions of convex problems
- scientific article; zbMATH DE number 3925675
- A successive constraint approach to solving parameter-dependent linear matrix inequalities
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- scientific article; zbMATH DE number 2084716
- A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
- A rigorous lower bound for the optimal value of convex optimization problems
Cites work
- scientific article; zbMATH DE number 1824045 (Why is no real title available?)
- scientific article; zbMATH DE number 3491650 (Why is no real title available?)
- 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 reduced basis model with parametric coupling for fluid-structure interaction problems
- A successive constraint linear optimization method for lower bounds of parametric coercivity and inf-sup stability constants
- 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
- Efficient reduced-basis treatment of nonaffine and nonlinear partial differential equations
- Estimation of the Error in the Reduced Basis Method Solution of Nonlinear Equations
- Improved successive constraint method baseda posteriorierror estimate for reduced basis approximation of 2D Maxwell's problem
- Numerical approximation of partial differential equations
- On the Error Behavior of the Reduced Basis Technique for Nonlinear Finite Element Approximations
- On the approximation of stability factors for general parametrized partial differential equations with a two-level affine decomposition
- Output bounds for reduced-basis approximations of symmetric positive definite eigenvalue problems
- Reduced Basis Error Bound Computation of Parameter-Dependent Navier–Stokes Equations by the Natural Norm Approach
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- Reduced basis method for finite volume approximations of parametrized linear evolution equations
- Reduced basis method for multi-parameter-dependent steady Navier-Stokes equations: applications to natural convection in a cavity
- Reduced basis method for the rapid and reliable solution of partial differential equations
- Spectral Methods in MATLAB
- ``Natural norm a posteriori error estimators for reduced basis approximations
Cited in
(7)- A robust error estimator and a residual-free error indicator for reduced basis methods
- A natural-norm successive constraint method for inf-sup lower bounds
- Dual natural-norm a posteriori error estimators for reduced basis approximations to parametrized linear equations
- Offline-enhanced reduced basis method through adaptive construction of the surrogate training set
- An iterative multi‐fidelity approach for model order reduction of multidimensional input parametric PDE systems
- Adaptive greedy algorithms based on parameter-domain decomposition and reconstruction for the reduced basis method
- A goal-oriented reduced basis methods-accelerated generalized polynomial chaos algorithm
This page was built for publication: A certified natural-norm successive constraint method for parametric inf-sup lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891690)
