A Lanczos method for approximating composite functions

@article{Constantine2011ALM,
  title={A Lanczos method for approximating composite functions},
  author={Paul G. Constantine and Eric T. Phipps},
  journal={Appl. Math. Comput.},
  year={2011},
  volume={218},
  pages={11751-11762}
}

Figures from this paper

A Lanczos-Stieltjes method for one-dimensional ridge function approximation and integration

The key elements of the method are approximating the univariate density of the given linear combination of inputs by repeated convolutions and a Lanczos-Stieltjes method for constructing orthogonal polynomials and Gaussian quadrature.

Iterative Polynomial Approximation Adapting to Arbitrary Probability Distribution

The paper addresses the impact of this constraint on the method, in particular analyzing the interplay between aliasing and truncation errors, depending on the type of functional to be represented, in a new moment/generalized polynomial chaos (gPC) based approximation method.

Efficient uncertainty propagation for network multiphysics systems

This work proposes an intrusive methodology that exploits the structure of the network coupled multiphysics system to efficiently construct a polynomial surrogate of the model output as a function of uncertain inputs, which results in substantial computational savings.

Systems of Gaussian process models for directed chains of solvers

A method for recursively generating sequential rational approximations to $\sqrt[n]{k}$

  • J. Nance
  • Computer Science, Mathematics
  • 2011
A simple recursion is derived that generates a sequence of fractions approximating $\sqrt[n]{k}$ with increasing accuracy, effectively proving convergence without notions from standard analysis of infinitesimals.

Gauss–Christoffel quadrature for inverse regression: applications to computer experiments

This work employs the well-known tools from numerical analysis to produce new algorithms that improve upon the Riemann sum-based numerical integration in SIR and SAVE, and shows that this approach approximates the desired integrals, and study the behavior of LSIR and LSAVE with two numerical examples.

Gauss–Christoffel quadrature for inverse regression: applications to computer experiments

This work employs the well-known tools from numerical analysis to produce new algorithms that improve upon the Riemann sum-based numerical integration in SIR and SAVE, and shows that this approach approximates the desired integrals, and study the behavior of LSIR and LSAVE with two numerical examples.

Comparison of adaptive uncertainty quantification approaches for shock wave-dominated flows

Shock wave-dominated systems are very sensitive to uncertainties in initial or boundary conditions as they often give rise to strong non-linear responses when subject to perturbations. As global

Gaussian Quadrature and Polynomial Approximation for One-Dimensional Ridge Functions

Many of the input-parameter-to-output-quantity-of-interest maps that arise in computational science admit a surprising low-dimensional structure, where the outputs vary primarily along a handful of...

References

SHOWING 1-10 OF 28 REFERENCES

High-Order Collocation Methods for Differential Equations with Random Inputs

A high-order stochastic collocation approach is proposed, which takes advantage of an assumption of smoothness of the solution in random space to achieve fast convergence and requires only repetitive runs of an existing deterministic solver, similar to Monte Carlo methods.

On sensitivity of Gauss–Christoffel quadrature

It is shown that even a small perturbation of a distribution function can cause large differences in Gauss–Christoffel quadrature estimates.

Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations

It is demonstrated that finite precision Lanczos and conjugate gradient computations for solving a symmetric positive definite linear system $Ax = b$ or computing the eigenvalues of A behave very

Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences

Non intrusive iterative stochastic spectral representation with application to compressible gas dynamics

The Lanczos and conjugate gradient algorithms in finite precision arithmetic

A tribute is paid to those who have made an understanding of the Lanczos and conjugate gradient algorithms possible through their pioneering work, and to review recent solutions of several open problems that have also contributed to knowledge of the subject.

The Lanczos algorithm with partial reorthogonalization

Partial reorthogonalization (PRO) is proposed as a new method for maintain- ing semiorthogonality among the Lanczos vectors and is applied to the solution of large symmetric systems of linear equations and results obtained compare favorably with the conjugate gradient method.

Matrices, Moments and Quadrature with Applications

This computationally oriented book describes and explains the mathematical relationships among matrices, moments, orthogonal polynomials, quadrature rules, and the Lanczos and conjugate gradient

Analysis of the symmetric Lanczos algorithm with reorthogonalization methods

Iterative methods for solving linear systems

  • A. Greenbaum
  • Computer Science
    Frontiers in applied mathematics
  • 1997
This paper presents a brief overview of the State of the Art Notation Review of Relevant Linear Algebra and some of the algorithms used in this review, as well as some basic ideas of Domain Decomposition Methods.