Skip to search formSkip to main contentSkip to account menu

Lehmer–Schur algorithm

Known as: Lehmer, Schur algorithm, Lehmer-Schur Algorithm 
In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm extending the idea of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Bisection methodList of numerical analysis topicsNewton's methodNumerical Recipes

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Progress in Aerodynamic Shape Optimization Based on the Reynolds-Averaged Navier-Stokes Equations
This paper presents the application of an aerodynamic shape optimization methodology, Jetstream, to several cases in order to… 
2013
2013
A parallel Newton-Krylov-Schur flow solver for the Navier-Stokes equations discretized using summation-by-parts operators
The objective of the present paper is to demonstrate the effectiveness of a spatial discretization based on summation-by-parts… 
2012
2012
A parallel Newton-Krylov-Schur flow solver for the Reynolds-Averaged Navier-Stokes equations
This paper presents a parallel Newton-Krylov flow solution algorithm for the threedimensional Navier-Stokes equations coupled… 
2010
2010
Fast root-MUSIC for arbitrary arrays
By using the manifold separation techniques, root-MUSIC designed for uniform linear arrays has been extended to arbitrary… 
2010
2010
A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
2002
2002
Speech enhancement as a realisation issue
2001
2001
Linear Fractional Transformations and Balanced Realization of Discrete-Time Stable All-Pass Systems
2001
2001
Stable factorization for Hankel and Hankel‐like matrices
This paper gives fast O(n2) algorithms for the factorization of positive‐definite and indefinite Hankel matrices. The algorithms… 
1991
1991
Schur algorithms for Hermitian Toeplitz, and Hankel matrices with singular leading principal submatrices
It is shown how a simple matrix algebra procedure can be used to induce Schur-type algorithms for the solution of certain… 
1983
1983
A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance
A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance concept is given. It turns out that… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)