All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2 Next

Displaying 21 – 40 of 183

Showing per page

A Solver for Complex-Valued Parametric Linear Systems

Popova, Evgenija, Kolev, Lyubomir, Krämer, Walter (2010)

Serdica Journal of Computing

This work reports on a new software for solving linear systems involving affine-linear dependencies between complex-valued interval parameters. We discuss the implementation of a parametric residual iteration for linear interval systems by advanced communication between the system Mathematica and the library C-XSC supporting rigorous complex interval arithmetic. An example of AC electrical circuit illustrates the use of the presented software.* This work was partly supported by the DFG grant GZ:...

A spectral characterization of the behavior of discrete time AR–representations over a finite time interval

E. N. Antoniou, Antonis I. G. Vardulakis, Nikolas P. Karampetakis (1998)

Kybernetika

In this paper we investigate the behavior of the discrete time AR (Auto Regressive) representations over a finite time interval, in terms of the finite and infinite spectral structure of the polynomial matrix involved in the AR-equation. A boundary mapping equation and a closed formula for the determination of the solution, in terms of the boundary conditions, are also gived.

An algebraic construction of discrete wavelet transforms

Jaroslav Kautský (1993)

Applications of Mathematics

Discrete wavelets are viewed as linear algebraic transforms given by banded orthogonal matrices which can be built up from small matrix blocks satisfying certain conditions. A generalization of the finite support Daubechies wavelets is discussed and some special cases promising more rapid signal reduction are derived.

An improvement of Euclid's algorithm

Zítko, Jan, Kuřátko, Jan (2010)

Programs and Algorithms of Numerical Mathematics

The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using c - s transformation and Q R -factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.

An introduction to hierarchical matrices

Wolfgang Hackbusch, Lars Grasedyck, Steffen Börm (2002)

Mathematica Bohemica

We give a short introduction to a method for the data-sparse approximation of matrices resulting from the discretisation of non-local operators occurring in boundary integral methods or as the inverses of partial differential operators. The result of the approximation will be the so-called hierarchical matrices (or short ℋ -matrices). These matrices form a subset of the set of all matrices and have a data-sparse representation. The essential operations for these matrices (matrix-vector and matrix-matrix...

Currently displaying 21 – 40 of 183