arrow
Return

A Lanczos method for approximating composite functions

delete2012-08-01
delete7
delete
OA
AI
P
Paul G. Constantine *
E
Eric Phipps
DOI:10.1016/j.amc.2012.05.009delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
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. (C) 2012 Elsevier Inc. All rights reserved.
Keywords:
Dimension reduction
Lanczos' method
Orthogonal polynomials
Gaussian quadrature
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Mathematics and Computation cover
Applied Mathematics and Computation
IF:
3.4
Papers:
2.3W
Citations:
3.3W

Organization

S
Stanford University
Scholars:
9.6W
Papers: 8.2W
Citations: 17.0W
U
united states department of energy (doe)
Scholars:
11.3W
Papers: 9.6W
Citations: 246