A Lanczos method for approximating composite functions
From MaRDI portal
Abstract: We seek to approximate a composite function h(x) = g(f(x)) with a global polynomial. The standard approach chooses points x in the domain of f and computes h(x) at each point, which requires an evaluation of f and an evaluation of g. We present a Lanczos-based procedure that implicitly approximates g with a polynomial of f. By constructing a quadrature rule for the density function of f, we can approximate h(x) using many fewer evaluations of g. The savings is particularly dramatic when g is much more expensive than f or the dimension of x is large. We demonstrate this procedure with two numerical examples: (i) an exponential function composed with a rational function and (ii) a Navier-Stokes model of fluid flow with a scalar input parameter that depends on multiple physical quantities.
Recommendations
- Enhanced matrix function approximation
- A restarted Lanczos approximation to functions of a symmetric matrix
- Computing \(f(A)b\) via least squares polynomial approximations
- Estimating composite functions by model selection
- The extended global Lanczos method, Gauss-Radau quadrature, and matrix function approximation
Cites work
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 2107939 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- An overview of the Trilinos project
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Efficient descriptor-vector multiplications in stochastic automata networks
- High-Order Collocation Methods for Differential Equations with Random Inputs
- Large-scale stabilized FE computational analysis of nonlinear steady-state transport/reaction systems
- Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
- Non intrusive iterative stochastic spectral representation with application to compressible gas dynamics
- On sensitivity of Gauss-Christoffel quadrature
- Parallel iterative methods for sparse linear systems
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- The Lanczos Algorithm With Partial Reorthogonalization
- The Lanczos and Conjugate Gradient Algorithms
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- The numerically stable reconstruction of Jacobi matrices from spectral data
- Time-dependent generalized polynomial chaos
Cited in
(6)- Gauss-Christoffel quadrature for inverse regression: applications to computer experiments
- Gaussian quadrature and polynomial approximation for one-dimensional ridge functions
- scientific article; zbMATH DE number 5812035 (Why is no real title available?)
- Systems of Gaussian process models for directed chains of solvers
- Efficient uncertainty propagation for network multiphysics systems
- Iterative polynomial approximation adapting to arbitrary probability distribution
This page was built for publication: A Lanczos method for approximating composite functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388581)
