EuDML | Browse

Items

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

Displaying 381 – 400 of 1340

Computation of bifurcated branches in a free boundary problem arising in combustion theory

Olivier Baconneau, Claude-Michel Brauner, Alessandra Lunardi (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

We consider a parabolic 2D Free Boundary Problem, with jump conditions at the interface. Its planar travelling-wave solutions are orbitally stable provided the bifurcation parameter $u_{*}$ does not exceed a critical value $u_{*}^{c}$ . The latter is the limit of a decreasing sequence $(u_{*}^{k})$ of bifurcation points. The paper deals with the study of the 2D bifurcated branches from the planar branch, for small k. Our technique is based on the elimination of the unknown front, turning the problem into a fully nonlinear...

Computation of determinants and inverses of rectangular or singular matrices using residue arithmetic.

Stanimirović, Predag (1996)

Publications de l'Institut Mathématique. Nouvelle Série

Computation of eigenvalue and eigenvector derivatives for a general complex-valued eigensystem.

van der Aa, N.P., ter Morsche, H.G., Mattheij, R.R.M. (2007)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Computation of the Smallest Positive Eigenvalue of a Quadratic ..-matrix.

Rainer Garus, Tassilo Küpper (1990)

Numerische Mathematik

Computing and Visualizing Solution Sets of Interval Linear Systems

Krämer, Walter (2007)

Serdica Journal of Computing

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006The computation of the exact solution set of an interval linear system is a nontrivial task [2, 13]. Even in two and three dimensions a lot of work has to be done. We demonstrate two different realizations. The first approach (see [16]) is based on Java, Java3D, and the BigRational package [21]. An applet allows modifications of the matrix coefficients and/or the coefficients...

Computing codimensions and generic canonical forms for generalized matrix products.

Kagstrom, Bo, Karlsson, Lars, Kressner, Daniel (2011)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Computing $e x p (- τ A) b$ with Laguerre polynomials.

Sheehan, Bernard N., Saad, Yousef, Sidje, Roger B. (2010)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

Computing exponential for iterative splitting methods: algorithms and applications.

Geiser, Jürgen (2011)

Journal of Applied Mathematics

Computing generalized inverse systems using matrix pencil methods

Andras Varga (2001)

International Journal of Applied Mathematics and Computer Science

We address the numerically reliable computation of generalized inverses of rational matrices in descriptor state-space representation. We put particular emphasis on two classes of inverses: the weak generalized inverse and the Moore-Penrose pseudoinverse. By combining the underlying computational techniques, other types of inverses of rational matrices can be computed as well. The main computational ingredient to determine generalized inverses is the orthogonal reduction of the system matrix pencil...