Sciweavers

20 search results - page 1 / 4
» Partitioned Triangular Tridiagonalization
Sort
View
TOMS
2011
101views more  TOMS 2011»
12 years 11 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
IPPS
2002
IEEE
13 years 9 months ago
A Parallel Two-Level Hybrid Method for Diagonal Dominant Tridiagonal Systems
A new method, namely the Parallel Two-Level Hybrid (PTH) method, is developed to solve tridiagonal systems on parallel computers. PTH is designed based on Parallel Diagonal Domina...
Xian-He Sun, Wu Zhang
CDC
2008
IEEE
121views Control Systems» more  CDC 2008»
13 years 11 months ago
Lossless scalar functions: Boundary interpolation, Schur algorithm and Ober's canonical form
Abstract— In [1] a balanced canonical form for continuoustime lossless systems was presented. This form has a tridiagonal dynamical matrix A and the useful property that the corr...
Martine Olivi, Bernard Hanzon, Ralf L. M. Peeters
CGA
2000
13 years 4 months ago
Metamorphosis of Arbitrary Triangular Meshes
Recently, animations with deforming objects have been frequently used in various computer graphics applications. Metamorphosis (or morphing) of three-dimensional objects is one of...
Takashi Kanai, Hiromasa Suzuki, Fumihiko Kimura
CASC
2007
Springer
108views Mathematics» more  CASC 2007»
13 years 11 months ago
Comprehensive Triangular Decomposition
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
Changbo Chen, Oleg Golubitsky, François Lem...