A technique for computing minors of binary Hadamard matrices and application to the growth problem.
We give a short introduction to a method for the data-sparse approximation of matrices resulting from the discretisation of non-local operators occurring in boundary integral methods or as the inverses of partial differential operators. The result of the approximation will be the so-called hierarchical matrices (or short -matrices). These matrices form a subset of the set of all matrices and have a data-sparse representation. The essential operations for these matrices (matrix-vector and matrix-matrix...
Mediante integrali multipli agevoli per il calcolo numerico vengono espressi il valore assoluto di un determinante qualsiasi e le formule di Cramer.