Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,182,830 papers from all fields of science
Search
Sign In
Create Free Account
Lehmer–Schur algorithm
Known as:
Lehmer
, Schur algorithm
, Lehmer-Schur Algorithm
Expand
In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm extending the idea of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Bisection method
List of numerical analysis topics
Newton's method
Numerical Recipes
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Fast root-MUSIC for arbitrary arrays
Jie Zhuang
,
W. Li
,
A. Manikas
2010
Corpus ID: 59455584
By using the manifold separation techniques, root-MUSIC designed for uniform linear arrays has been extended to arbitrary…
Expand
2010
2010
A parallel Newton-Krylov-Schur flow solver for the Navier-Stokes equations using the SBP-SAT approach
M. Osuský
,
Jason E. Hicken
,
D. Zingg
2010
Corpus ID: 19019687
This paper presents a three-dimensional Newton-Krylov flow solver for the NavierStokes equations which uses summation-by-parts…
Expand
Highly Cited
2002
Highly Cited
2002
A Schur Algorithm for Computing Matrix pth Roots
Matthew I. Smith
SIAM Journal on Matrix Analysis and Applications
2002
Corpus ID: 17686438
Any nonsingular matrix has pth roots. One way to compute matrix pth roots is via a specialized version of Newton's method, but…
Expand
2001
2001
Linear Fractional Transformations and Balanced Realization of Discrete-Time Stable All-Pass Systems
R. Peeters
,
B. Hanzon
,
M. Olivi
2001
Corpus ID: 7134511
1998
1998
A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations
S. Chandrasekaran
,
A. H. Sayed
SIAM Journal on Matrix Analysis and Applications
1998
Corpus ID: 123193015
We derive a stable and fast solver for nonsymmetric linear systems of equations with shift structured coefficient matrices (e.g…
Expand
1996
1996
A Parallel Algorithm for the Sylvester Observer Equation
C. Bischof
,
B. Datta
,
A. Purkayastha
SIAM Journal on Scientific Computing
1996
Corpus ID: 15392375
We present a new algorithm for solving the Sylvester observer equation arising in the context of the Luenberger observer. The…
Expand
1996
1996
High-performance algorithms to solve toeplitz and block toeplitz matrices
K. Gallivan
,
S. Thirumalai
1996
Corpus ID: 123422463
Fast algorithms to factor Toeplitz matrices have existed since the beginning of this century. The two most notable algorithms to…
Expand
1985
1985
The Schur algorithm and its applications
A. Yagle
,
B. Levy
1985
Corpus ID: 128279
The Schur algorithm and its time-domain counterpart, the fast Cholseky recursions, are some efficient signal processing…
Expand
Highly Cited
1984
Highly Cited
1984
Orthogonal digital filters for VLSI implementation
S. Rao
,
T. Kailath
1984
Corpus ID: 54131459
In this paper, an algorithm is developed for the realization of any stable, passive digital rational transfer function in a…
Expand
Highly Cited
1981
Highly Cited
1981
Schur recursions, error formulas, and convergence of rational estimators for stationary stochastic sequences
P. Dewilde
,
H. Dym
IEEE Transactions on Information Theory
1981
Corpus ID: 38273618
An exact and approximate realization theory for estimation and model filters of second-order stationary stochastic sequences is…
Expand
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)
ACCEPT & CONTINUE