Displaying 741 – 760 of 3024

Showing per page

Diffeomorphisms of Rn with oscillatory jacobians.

Waldyr M. Oliva, Nelson M. Kuhl, Luiz T. Magalhâes (1993)

Publicacions Matemàtiques

The paper presents, mainly, two results: a new proof of the spectral properties of oscillatory matrices and a transversality theorem for diffeomorphisms of Rn with oscillatory jacobian at every point and such that NM(f(x) - f(y)) ≤ NM(x - y) for all elements x,y ∈ Rn, where NM(x) - 1 denotes the maximum number of sign changes in the components zi of z ∈ Rn, where all zi are non zero and z varies in a small neighborhood of x. An application to a semiimplicit discretization of the scalar heat equation...

Directed forests with application to algorithms related to Markov chains

Piotr Pokarowski (1999)

Applicationes Mathematicae

This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.

Discrete-time symmetric polynomial equations with complex coefficients

Didier Henrion, Jan Ježek, Michael Šebek (2002)

Kybernetika

Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.

Currently displaying 741 – 760 of 3024