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 23 Next

Displaying 441 – 460 of 1330

Showing per page

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.

Domain decomposition methods coupled with parareal for the transient heat equation in 1 and 2 spatial dimensions

Ladislav Foltyn, Dalibor Lukáš, Ivo Peterek (2020)

Applications of Mathematics

We present a parallel solution algorithm for the transient heat equation in one and two spatial dimensions. The problem is discretized in space by the lowest-order conforming finite element method. Further, a one-step time integration scheme is used for the numerical solution of the arising system of ordinary differential equations. For the latter, the parareal method decomposing the time interval into subintervals is employed. It leads to parallel solution of smaller time-dependent problems. At...

Dynamical systems method for solving linear finite-rank operator equations

N. S. Hoang, A. G. Ramm (2009)

Annales Polonici Mathematici

A version of the dynamical systems method (DSM) for solving ill-conditioned linear algebraic systems is studied. An a priori and an a posteriori stopping rules are justified. An iterative scheme is constructed for solving ill-conditioned linear algebraic systems.

Efficiency of cropping system designs via base contrast

U. Bronowicka-Mielniczuk, J. Mielniczuk, T. Przybysz (2000)

Applicationes Mathematicae

The present article is a continuation of previous papers by the same authors devoted to the efficiency of crop rotation experiments. We focus on plans distinguished by the cyclical pattern of the incidence matrix. For practical reasons, we slightly modify the efficiency coefficient. The relation between the resulting efficiency coefficients is examined. In addition, we provide a background material on crop rotation experiments.

Efficient Computing of some Vector Operations over GF(3) and GF(4)

Bouyukliev, Iliya, Bakoev, Valentin (2008)

Serdica Journal of Computing

The problem of efficient computing of the affine vector operations (addition of two vectors and multiplication of a vector by a scalar over GF (q)), and also the weight of a given vector, is important for many problems in coding theory, cryptography, VLSI technology etc. In this paper we propose a new way of representing vectors over GF (3) and GF (4) and we describe an efficient performance of these affine operations. Computing weights of binary vectors is also discussed.

Efficient numerical solution of mixed finite element discretizations by adaptive multilevel methods

Ronald H.W. Hoppe, Barbara Wohlmuth (1995)

Applications of Mathematics

We consider mixed finite element discretizations of second order elliptic boundary value problems. Emphasis is on the efficient iterative solution by multilevel techniques with respect to an adaptively generated hierarchy of nonuniform triangulations. In particular, we present two multilevel solvers, the first one relying on ideas from domain decomposition and the second one resulting from mixed hybridization. Local refinement of the underlying triangulations is done by efficient and reliable a...

Currently displaying 441 – 460 of 1330