Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,159,865 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.
2012
2012
A Recursive Blocked Schur Algorithm for Computing the Matrix Square Root
Edvin Deadman
,
N. Higham
,
R. Ralha
2012
Corpus ID: 9298355
The Schur method for computing a matrix square root reduces the matrix to the Schur triangular form and then computes a square…
Expand
2010
2010
Multipoint Schur algorithm, II: generalized moment problems, Gaussian processes and prediction
L. Baratchart
,
L. Golinskii
,
S. Kupin
2010
Corpus ID: 119127548
We use nowdays classical theory of generalized moment problems by Krein-Nudelman [1977] to define a special class of stochastic…
Expand
2005
2005
Efficient time-recursive implementation of matched filterbank spectral estimators
S. Alty
,
A. Jakobsson
,
E. Larsson
IEEE Transactions on Circuits and Systems Part 1…
2005
Corpus ID: 1602040
In this paper, we present a computationally efficient sliding window time updating of the Capon and amplitude and phase…
Expand
2005
2005
ON A NEW CLASS OF SMARANDACHE PRIME NUMBERS
J. Earls
2005
Corpus ID: 116099982
The purpose of this note is to report on the discovery of some new prime numbers that were built from factorials, the Smarandache…
Expand
2004
2004
On the application of different numerical methods to obtain null-spaces of polynomial matrices . Part 2 : block displacement structure algorithms
J. C. Zúñiga
,
D. Henrion
2004
Corpus ID: 11883490
Motivated by some control problems requiring the extraction of the null-space of large polynomial matrices, we introduce two fast…
Expand
2004
2004
A Krylov-Schur Algorithm for Matrix Products ?
D. Kressner
2004
Corpus ID: 14885389
Stewart’s recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted Arnoldi algorithm which…
Expand
2001
2001
On a recursive state-space method for discrete-time H 2-approximation
R. Peeters
2001
Corpus ID: 16635475
In [4] a gradient method for discrete-time H2-approximation was developed which proceeds recursively with respect to the order n…
Expand
1994
1994
A look-ahead Schur algorithm
K. Gallivan
,
S. Thirumalai
,
P. Dooren
1994
Corpus ID: 119756665
The classical Schur algorithm computes the LDL T factorization of a symmetric Toeplitz matrix in O(n 2 ) operations, but requires…
Expand
1991
1991
Schur parametrization of symmetric indefinite matrices
K. Diepold
,
R. Pauli
IEEE International Conference on Acoustics…
1991
Corpus ID: 120663285
It is shown that the generalized Schur algorithm for triangular factorization of symmetric positive definite matrices has a…
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