Sciweavers

780 search results - page 17 / 156
» Stability of fast algorithms for structured linear systems
Sort
View
HYBRID
2000
Springer
15 years 1 months ago
Optimization-Based Verification and Stability Characterization of Piecewise Affine and Hybrid Systems
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
Alberto Bemporad, Fabio Danilo Torrisi, Manfred Mo...
EUROPAR
2011
Springer
13 years 9 months ago
A Bit-Compatible Parallelization for ILU(k) Preconditioning
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...
Xin Dong 0004, Gene Cooperman
SOFSEM
2010
Springer
15 years 6 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
SASO
2008
IEEE
15 years 4 months ago
Wanderer between the Worlds - Self-Organized Network Stability in Attack and Random Failure Scenarios
Many real–world networks show a scale–free degree distribution, a structure that is known to be very stable in case of random failures. Unfortunately, the very same structure ...
Katharina Anna Zweig, Karin Zimmermann
ITNG
2010
IEEE
15 years 3 months ago
A Fast and Stable Incremental Clustering Algorithm
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
Steven Young, Itamar Arel, Thomas P. Karnowski, De...