Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,076,941 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.
2013
2013
A parallel Newton-Krylov-Schur flow solver for the Navier-Stokes equations discretized using summation-by-parts operators
M. Osuský
,
D. Zingg
2013
Corpus ID: 49362603
The objective of the present paper is to demonstrate the effectiveness of a spatial discretization based on summation-by-parts…
Expand
2012
2012
A parallel Newton-Krylov-Schur flow solver for the Reynolds-Averaged Navier-Stokes equations
M. Osuský
,
D. Zingg
2012
Corpus ID: 53592561
This paper presents a parallel Newton-Krylov flow solution algorithm for the threedimensional Navier-Stokes equations coupled…
Expand
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 thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
Wei Jiang
,
Gang Wu
Computers and Mathematics with Applications
2010
Corpus ID: 36330527
2002
2002
Speech enhancement as a realisation issue
É. Grivel
,
M. Gabrea
,
M. Najim
Signal Processing
2002
Corpus ID: 13523473
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
2000
2000
The Schur algorithm and coefficient characterizations for generalized Schur functions
T. Constantinescu
2000
Corpus ID: 91178971
In this paper we analyze the existence of a Schur algorithm and obtain coefficient characterizations for the functions in a…
Expand
1994
1994
Solving linear matrix equations in control problems on distributed memory multiprocessors
V. Hernández
,
E. S. Quintana
,
M. Marqués
Proceedings of 33rd IEEE Conference on Decision…
1994
Corpus ID: 118012892
Linear matrix equations such as Sylvester, Lyapunov and commutant matrix equations play an important role in many control…
Expand
1989
1989
An extension of the split Levinson algorithm and its relatives to the joint process estimation problem
P. Delsarte
,
Y. Genin
IEEE Transactions on Information Theory
1989
Corpus ID: 2993274
It is shown that the split Levinson algorithm, the split Schur algorithm, and the split lattice algorithm to compute the…
Expand
1983
1983
A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance
P. Delsarte
,
Y. Genin
,
Y. Kamp
IEEE Transactions on Information Theory
1983
Corpus ID: 9595311
A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance concept is given. It turns out that…
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