# A Chebyshev polynomial interval-searching method (“Lanczos economization”) for solving a nonlinear equation with application to the nonlinear eigenvalue problem

@inproceedings{Boyd1995ACP, title={A Chebyshev polynomial interval-searching method (“Lanczos economization”) for solving a nonlinear equation with application to the nonlinear eigenvalue problem}, author={John P. Boyd}, year={1995} }

- Published 1995
DOI:10.1006/jcph.1995.1075

Abstract To search a given real interval for roots, our algorithm is to replace f(λ) by f N (λ) , its N-term Chebyshev expansion on the search interval λ ∈ [λ min , λ max ], and compute the roots of this proxy. This strategy is efficient if and only if f(λ) itself is expensive to evaluation, such as when f(λ) is the determinant of a large matrix whose elements depend nonlinearly on λ. For such expensive functions, it is much cheaper to search for zeros of f N (λ) , which can be evaluated in O(N… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-9 OF 9 CITATIONS

## Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding

VIEW 6 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Finding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix

VIEW 4 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Roots of Polynomials Expressed in Terms of Orthogonal Polynomials

VIEW 3 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Sturm root counting using chebyshev expansion

VIEW 1 EXCERPT

CITES BACKGROUND

## Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries

VIEW 3 EXCERPTS

CITES BACKGROUND

## Preconditioned techniques for large eigenvalue problems

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND