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.
2014
2014
This paper discusses the expressive nature of phrasal compounds (PCs) in English (and German) and proposes an analysis in a… 
2011
2011
Abstract : The Israeli incursions into Lebanon in mid-2006 and into Gaza in late 2008/early-2009 are important studies in… 
2004
2004
Natural language is characterised by enormous linguistic variation (e.g., Fetzer (2003)). Such variation is not random, but is… 
1995
1995
This paper describes the design of pragmatic-interpretation and dialogue-management modules in an automatic enquiry system that… 
1995
1995
We present a 2-D extension of the minimum free energy (MFE) autoregressive parameter and spectral estimation technique. MFE can… 
1991
1991
In a series of laboratory experiments it was observed that the rate and stoichiometry of aluminum hydroxide precipitation… 
1984
1984
A model for a finite buffer is described. The equilibrium equations for the number in the buffer have Toeplitz form. This enables… 
1968
1968
where x is an n vector, e the same small parameter as in (1.1) and / an n vector function periodic or almost periodic in t. The…