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 78

Showing per page

Comparison of algorithms for calculation of the greatest common divisor of several polynomials

Eckstein, Jiří, Zítko, Jan (2015)

Programs and Algorithms of Numerical Mathematics

The computation of the greatest common divisor (GCD) has many applications in several disciplines including computer graphics, image deblurring problem or computing multiple roots of inexact polynomials. In this paper, Sylvester and Bézout matrices are considered for this purpose. The computation is divided into three stages. A rank revealing method is shortly mentioned in the first one and then the algorithms for calculation of an approximation of GCD are formulated. In the final stage the coefficients...

Complete solution of tropical vector inequalities using matrix sparsification

Nikolai Krivulin (2020)

Applications of Mathematics

We examine the problem of finding all solutions of two-sided vector inequalities given in the tropical algebra setting, where the unknown vector multiplied by known matrices appears on both sides of the inequality. We offer a solution that uses sparse matrices to simplify the problem and to construct a family of solution sets, each defined by a sparse matrix obtained from one of the given matrices by setting some of its entries to zero. All solutions are then combined to present the result in a...

Complexity issues for the symmetric interval eigenvalue problem

Milan Hladík (2015)

Open Mathematics

We study the problem of computing the maximal and minimal possible eigenvalues of a symmetric matrix when the matrix entries vary within compact intervals. In particular, we focus on computational complexity of determining these extremal eigenvalues with some approximation error. Besides the classical absolute and relative approximation errors, which turn out not to be suitable for this problem, we adapt a less known one related to the relative error, and also propose a novel approximation error....

Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations

Radek Kučera (2005)

Applications of Mathematics

The paper deals with fast solving of large saddle-point systems arising in wavelet-Galerkin discretizations of separable elliptic PDEs. The periodized orthonormal compactly supported wavelets of the tensor product type together with the fictitious domain method are used. A special structure of matrices makes it possible to utilize the fast Fourier transform that determines the complexity of the algorithm. Numerical experiments confirm theoretical results.

Composite grid finite element method: Implementation and iterative solution with inexact subproblems

Radim Blaheta, P. Byczanski, Roman Kohut (2002)

Applications of Mathematics

This paper concerns the composite grid finite element (FE) method for solving boundary value problems in the cases which require local grid refinement for enhancing the approximating properties of the corresponding FE space. A special interest is given to iterative methods based on natural decomposition of the space of unknowns and to the implementation of both the composite grid FEM and the iterative procedures for its solution. The implementation is important for gaining all benefits of the described...

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...

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...

Currently displaying 21 – 40 of 78