Sciweavers

95 search results - page 6 / 19
» Fast linear algebra is stable
Sort
View
CSL
2005
Springer
14 years 28 days ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
AUTOMATICA
1999
66views more  AUTOMATICA 1999»
13 years 7 months ago
Fast switches in relay feedback systems
Relays are common in automatic control systems. Even linear systems with relay feedback are, however, far from fully understood. New results are given about the behavior of these ...
Karl Henrik Johansson, Anders Rantzer, Karl Johan ...
HASKELL
2006
ACM
14 years 1 months ago
Statically typed linear algebra in Haskell
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
Frederik Eaton
CORR
2010
Springer
61views Education» more  CORR 2010»
13 years 7 months ago
A weakly stable algorithm for general Toeplitz systems
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
Adam W. Bojanczyk, Richard P. Brent, Frank R. de H...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Asymptotically Stable Walking of a Five-Link Underactuated 3D Bipedal Robot
This paper presents three feedback controllers that achieve an asymptotically stable, periodic, and fast walking gait for a 3D bipedal robot consisting of a torso, revolute knees, ...
Christine Chevallereau, Jessy W. Grizzle, Ching-Lo...