Related papers: An Elementary Proof of Dodgson's Condensation Meth…
Recently, the Dodgson's determinant condensation algorithm was revisited in many papers [College Math. Journal 42(1)(2011): 43--54, College Math. Journal 38(2)(2007): 85--95, Math Horizons 14(2)(2006): 12--15},etc.]. This method is…
The Rev. Dodgson's determinant condensation rule is given a bijective proof.
Dodgson's method of computing determinants was recently revisited in a paper that appeared in the College Math Journal. The method is attractive, but fails if an interior entry of an intermediate matrix has the value zero. This paper…
In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.
In this {\it case study}, we hope to show why Sheldon Axler was not just wrong, but {\em wrong}, when he urged, in 1995: ``Down with Determinants!''. We first recall how determinants are useful in enumerative combinatorics, and then…
We present here a new method for evaluating determinants -- the reduction method. Firstly, in the section 2, we apply it to third-order determinants and after, in the section 3, we generalize it to higher-order determinants. In the section…
Conflict of interest is the permanent companion of any population of agents (computational or biological). For that reason, the ability to compromise is of paramount importance, making voting a key element of societal mechanisms. One of the…
The Jacobi-Davidson method is one of the most popular approaches for iteratively computing a few eigenvalues and their associated eigenvectors of a large matrix. The key of this method is to expand the search subspace via solving the…
We present a ``method'' for bijective proofs for determinant identities, which is based on translating determinants to Schur functions by the Jacobi--Trudi identity. We illustrate this ``method'' by generalizing a bijective construction…
Calculating the log-determinant of a matrix is useful for statistical computations used in machine learning, such as generative learning which uses the log-determinant of the covariance matrix to calculate the log-likelihood of model…
This article describes an optimal method (conflation) to consolidate data from different experiments, and illustrates the advantages of conflation by graphical examples involving gaussian input distributions, and by a concrete numerical…
Civan and Sliepcevich [1, 2] suggested that special matrix solver should be developed to further reduce the computing effort in applying the differential quadrature (DQ) method for the Poisson and convection-diffusion equations. Therefore,…
Fast estimation of the single-particle density matrix is key to many applications in quantum chemistry and condensed matter physics. The best numerical methods leverage the fact that the density matrix elements $f(H)_{ij}$ decay rapidly…
The formulation of combinatorial differential forms, proposed by Forman for analysis of topological properties of discrete complexes, is extended by defining the operators required for analysis of physical processes dependent on scalar…
In contact mechanics computation, the constraint conditions on the contact surfaces are typically enforced by the Lagrange multiplier method, resulting in a saddle point system. The mortar finite element method is usually employed to…
Newton method is one of the most powerful methods for finding solutions of nonlinear equations and for proving their existence. In its "pure" form it has fast convergence near the solution, but small convergence domain. On the other hand…
We present a new approach that allows large time steps in dynamic simulations. Our approach, ConJac, is based on condensation, a technique for eliminating many degrees of freedom (DOFs) by expressing them in terms of the remaining degrees…
This paper presents a theorem which solves the problem of reduction of the determinant order by means of a transformation of it, into other determinant whose each element are a determinant of second order. This implies that, if the process…
We propose an efficient stochastic method to implement numerically the Bogolubov approach to study finite-temperature Bose-Einstein condensates. Our method is based on the Wigner representation of the density matrix describing the non…
Cool a piece of the Sun to 1000 K at one millibar pressure to yield a mineral assemblage consistent with those found in the most primitive meteorites. This is an equilibrium or fractional condensation experiment simulated by calculations…