Related papers: A Root-Free Splitting-Lemma for Systems of Linear …
This work presents a framework for parametric reduction in FEM, where geometry is controlled by a parameter without altering material properties or stress states. The inverse determinant in the weak form is expanded as a power series, with…
In the recent years we have witnessed a rapid development of new algorithmic techniques for parameterized algorithms for graph separation problems. We present experimental evaluation of two cornerstone theoretical results in this area:…
A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
The $\Sigma$-method for structural analysis of a differential-algebraic equation (DAE) system produces offset vectors from which the sparsity pattern of DAE's system Jacobian is derived; this pattern implies a fine block-triangular form…
The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that…
This paper presents a new approach to quadrify a polynomial programming problem, i.e. reduce the polynomial program to a quadratic program, before solving it. The proposed approach, QUAD-RLT, exploits the Reformulation-Linearization…
In this paper, the concept of matrix splitting is introduced to solve a large sparse ill-posed linear system via Tikhonov's regularization. In the regularization process, we convert the ill-posed system to a well-posed system. The…
We consider Lie and Strang splitting for the time integration of constrained partial differential equations with a nonlinear reaction term. Since such systems are known to be sensitive with respect to perturbations, the splitting procedure…
This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the $q$-analogues of projective systems and blocking sets. We also illustrate how to associate a classical…
We consider the problem of minimizing a convex, separable, nonsmooth function subject to linear constraints. The numerical method we propose is a block-coordinate extension of the Chambolle-Pock primal-dual algorithm. We prove convergence…
An effective method for generating linear equations of maximal symmetry in their much general normal form is obtained. In the said normal form, the coefficients of the equation are differential functions of the coefficient of the term of…
We consider the numerical integration of non-autonomous separable parabolic equations using high order splitting methods with complex coefficients (methods with real coefficients of order greater than two necessarily have negative…
We investigate splitting-type variational problems with some linear growth conditions. For balanced solutions of the associated Euler-Lagrange equation we receive a result analogous to Bernstein's theorem on non-parametric minimal surfaces.…
Dimensionality reduction in mechanical vibratory systems poses challenges for distributed structures including geometric nonlinearities, mainly because of the lack of invariance of the linear subspaces. A reduction method based on direct…
We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the…
Nonlinear balanced truncation is a model order reduction technique that reduces the dimension of nonlinear systems in a manner that accounts for either open- or closed-loop observability and controllability aspects of the system. Two…
This work introduces a systematic method for identifying analytical and semi-analytical solutions of force-free magnetic fields with plane-parallel and axial symmetry. The method of separation of variables is used, allowing the…
For a system of partial differential equations admitting point, contact, or higher symmetries, the framework of invariant reduction systematically computes how invariant geometric structures, such as conservation laws, presymplectic…
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct…