Suchergebnisse - F.2.1 Numerical Algorithms and Problems

Division-free computation of subresultants using Bezout matrices von Kerber, Michael

“… We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm given by Abdeljaoued et al. [J. Abdeljaoued, G. Diaz-Toca, and L …”
Volltext

Introducing: The Libflame Library for Dense Matrix Computations von Van Zee, Field, Chan, Ernie, van de Geijn, Robert, Quintana, Enrique, Quintana-Orti, Gregorio

“… While we did not know it when we started, these techniques appear to solve many of the programmability problems that now face us with the advent of multicore and many-core architectures …”
Volltext

Block LU decompositon of a band matrix on a systolic array von Robert, Yves

“… After a brief discussion on systolic arrays for band matrix LU or QR decomposition, we introduce a new systolic array for the block 2x2 LU decompositon of a …”
Volltext

Complexity results for some eigenvector problems von Eiter, Thomas, Gottlob, Georg

“… We address various problems in this context, and analyze their computational complexity. We find that different problems are complete for the complexity classes Applying …”
Volltext

Vlsi interconnection network for numerical solution of two point boundary value problems von Suros, R., Montagne, E.

“… generates diagonal or triangular sparse matrices. The original problem is partitioned into subproblems whose individual size fit available systolic network dimensions …”
Volltext

On the variable-depth-search heuristic for the linear-cost generalized assignment problem von Lin, Bertrand M.T., Huang, Y.S., Yu, H.K.

“… The classical assignment problem seeks to determine a mapping between a set of assignees and a set of assignments …”
Volltext

Systolic givens factorization of dense rectangular matrices von Cosnard, Michel, Robert, Yves

“… Given an m by n dense matrix A(m≧n) we consider parallel algorithms to compute its orthogonal factorization via Givens rotations …”
Volltext

A study of some addition chain problems von Tsai, Y.H., Chin, Y.H.

“… In this paper, some mathematical properties of the shortest-length addition chain are found for certain integers whose binary patterns meet some special forms; …”
Volltext

Parallel solution of dense linear systems using diagonalization methods von Cosnard, M., Robert, Y., Trystram, D.

“… We assume a shared memory computer with a number of processors p of the order of n, the size of the problem to be solved, We show that the best parallel version for Jordan's method is by rows whereas …”
Volltext

MONTE CARLO ALGORITHMS FOR ELLIPTIC DIFFERENTIAL EQUATIONS. DATA PARALLEL FUNCTIONAL APPROACH von DIMOV, I., KARAIVANOVA, A., KUCHEN, H., STOLTZE, H.

“… Monte Carlo algorithms for solving boundary value problems for elliptic differential equations are studied …”
Volltext

A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method von Gravvanis, G.A., Giannoutakis, K.M., Missirlis †, N.M.

“… systems on multi-computer systems. Application of the proposed method on a three dimensional boundary value problem is discussed and numerical results are given …”
Volltext

Wavelet applications in engineering electromagnetics von Sarkar, Tapan K., Salazar-Palma, Magdalena, Wicks, Michael C.

“… The authors describe the practical application of wavelets to the solution of electromagnetic field problems …”
Volltext