Sciweavers

7796 search results - page 3 / 1560
» On Generalized Schur Numbers
Sort
View
NA
2010
117views more  NA 2010»
13 years 3 months ago
A fast solver for linear systems with displacement structure
We describe a fast solver for linear systems with reconstructible Cauchylike structure, which requires O(rn2 ) floating point operations and O(rn) memory locations, where n is th...
Antonio Arico, Giuseppe Rodriguez
EUROPAR
2003
Springer
13 years 10 months ago
Parallel ScaLAPACK-Style Algorithms for Solving Continuous-Time Sylvester Matrix Equations
An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X −Xop(B) = C, where op(A) denotes A or its transpose AT , is presented. The paral...
Robert Granat, Bo Kågström, Peter Porom...
PPAM
2001
Springer
13 years 9 months ago
pARMS: A Package for Solving General Sparse Linear Systems on Parallel Computers
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solutio...
Yousef Saad, Masha Sosonkina
CORR
2006
Springer
89views Education» more  CORR 2006»
13 years 5 months ago
Finite-State Dimension and Real Arithmetic
We use entropy rates and Schur concavity to prove that, for every integer k 2, every nonzero rational number q, and every real number , the base-k expansions of , q + , and q all...
David Doty, Jack H. Lutz, Satyadev Nandakumar
COMBINATORICS
2000
142views more  COMBINATORICS 2000»
13 years 5 months ago
Harmonic Functions on Multiplicative Graphs and Interpolation Polynomials
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on th...
Alexei Borodin, Grigori Olshanski