M
Martin Morf
Researcher at Stanford University
Publications - 110
Citations - 5630
Martin Morf is an academic researcher from Stanford University. The author has contributed to research in topics: Matrix (mathematics) & Covariance. The author has an hindex of 32, co-authored 110 publications receiving 5565 citations.
Papers
More filters
Proceedings ArticleDOI
Recursive input-output and state-space solutions for continuous-time linear estimation problems
TL;DR: In this article, a general linear least squares estimation problem is considered and the optimal filters for filtering and smoothing can be recursively and efficiently calculated under certain structural assumptions about the covariance functions involved.
Journal ArticleDOI
Fast and stable algorithms for minimal design problems
TL;DR: In this article, a fast and numerically advantageous algorithm for solving minimal design problems (MDP) and a new, simpler test for the existence of a proper solution of the MDP are presented.
Proceedings ArticleDOI
State-space structures of ladder canonical forms
Martin Morf,D. L. Lee +1 more
TL;DR: LADder form MOdeling (LADMO) is attracting an increasing amount of interest and very little attention has been paid in the literature to the properties of the ladder forms from a system theoretic point of view.
Proceedings ArticleDOI
Scattering Arrays For Matrix Computations
Jean-Marc Delosme,Martin Morf +1 more
TL;DR: Several new mesh connected multiprocessor architectures are presented that are adapted to execute highly parallel algorithms for matrix alge-bra and signal processing, such as triangular- and eigen-decomposition, inversion and low-rank updat-ing of general matrices, as well as Toeplitz and Hankel related matrices.
Journal ArticleDOI
Efficient construction of canonical ladder forms for vector autoregressive processes
M. Hadidi,Martin Morf,B. Porat +2 more
TL;DR: In this paper, the problem of constructing canonical ladder realizations for vector autoregressive (AR) processes specified by their characteristic matrix polynomials is treated and two efficient procedures for solving this equation are presented, both requiring a number of operations that is proportional to at most the square of the model order.