Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations
From MaRDI portal
Publication:2009050
DOI10.1007/s11075-018-00648-9zbMath1437.65016arXiv1804.03881OpenAlexW2797138777WikidataQ128536504 ScholiaQ128536504MaRDI QIDQ2009050
Publication date: 27 November 2019
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.03881
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Algorithms for approximation of functions (65D15) Numerical chaos (65P20) Numerical integration (65D30)
Related Items (5)
Sensitivity Analysis for Stability of Uncertain Delay Differential Equations Using Polynomial Chaos Expansions ⋮ Tensor-Krylov method for computing eigenvalues of parameter-dependent matrices ⋮ Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification ⋮ Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations ⋮ PCA_SA
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved error bound on Gauss quadrature
- Approximate methods for stochastic eigenvalue problems
- Uncertain eigenvalue analysis by the sparse grid stochastic collocation method
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- Bivariate Lagrange interpolation at the Padua points: Computational aspects
- Nontensorial Clenshaw-Curtis cubature
- Continuous pole placement for delay equations
- Stochastic study of a non-linear self-excited system with friction
- Perturbation theory for linear operators.
- Further remarks on the effect of multiple spectral values on the dynamics of time-delay systems. Application to the control of a mechanical system
- Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations
- Parametric dominant pole algorithm for parametric model order reduction
- A method for solving stochastic eigenvalue problems II
- Robust stability optimization for linear delay systems in a probabilistic framework
- Inverse routh table construction and stability of delay equations
- Stability, Control, and Computation for Time-Delay Systems
- An Analytical Approach to Tuning of Delay-Based Controllers for LTI-SISO Systems
- Design of Proportional-Integral-Retarded (PIR) Controllers for Second-Order LTI Systems
- A Subspace Method for Large-Scale Eigenvalue Optimization
- ORTHOGONAL POLYNOMIAL EXPANSIONS FOR SOLVING RANDOM EIGENVALUE PROBLEMS
- Krylov-Based Model Order Reduction of Time-delay Systems
- Efficient characterization of the random eigenvalue problem in a polynomial chaos decomposition
- Stochastic convergence acceleration through basis enrichment of polynomial chaos expansions
- Spectral Methods for Uncertainty Quantification
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- On the Convergence Rates of Gauss and Clenshaw--Curtis Quadrature for Functions of Limited Regularity
- Low-Rank Solution Methods for Stochastic Eigenvalue Problems
- Polynomial Chaos Expansions for the Stability Analysis of Uncertain Delay Differential Equations
- An Explicit Formula for the Splitting of Multiple Eigenvalues for Nonlinear Eigenvalue Problems and Connections with the Linearization for the Delay Eigenvalue Problem
- Multivariate polynomial approximation in the hypercube
- On the convergence rates of Legendre approximation
- Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates
This page was built for publication: Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations
