Skip to search formSkip to main contentSkip to account menu

Levinson recursion

Known as: Block Levinson recursion, Levinson-Durbin, Block Levinson algorithm 
Levinson recursion or Levinson–Durbin recursion is a procedure in linear algebra to recursively calculate the solution to an equation involving a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
ABSTRACT Attempts to improve education often change how language is used in schools. Many such efforts aim to include minoritized… 
2011
2011
ion is possible unless it has a foundation in the form of some series of material elements, and these are the elements one must… 
Review
2011
Review
2011
There exist few quantitative assessments of the relationship between biodiversity per se and economic benefits at scales that are… 
2010
2010
This article considers the maximum likelihood estimation (MLE) of a class of stationary and invertible vector autoregressive… 
2002
2002
We introduce new two-sided Arnoldi recursions and use them to define a model reduction procedure for large, linear, time… 
1999
1999
Participant displays of oppositional stances are anticipated features in the events discussed here, gang graffiti and televised… 
1986
1986
The one-dimensional wave equation in a layered medium is considered. The inverse problem consists of computing the acoustic… 
1986
1986
An algorithm for solving a discrete-time Wiener-Hopf equation is presented based upon Euclid's algorithm. The discrete-time… 
1981
1981
A new technique is presented for efficiently generating colored noise. Instead of discarding initial samples to account for the…