A symbolic evaluation of determinants of matrices with recursive entries
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Matrices, determinants in number theory (11C20) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40) Numerical aspects of recurrence relations (65Q30) Symbolic computation and algebraic computation (68W30)
For a matrix \(A\) whose entries are given by specific recurrence relations of its first row and first column entries, the authors show that \(A\) can be factored as \(L\cdot U\) with a lower and upper triangular matrix. For several specified Fibonacci like recurrences the entries in \(L\) and \(U\) satisfy related recurrences that allow \(\det(A)\) to be evaluated symbolically for any dimension \(n\) of \(A\).
- More calculations on determinant evaluations
- The determinants of matrices with recursive entries
- The determinants of matrices constructed by subdiagonal, main diagonal and superdiagonal
- Proof of a conjecture on determinants of matrices whose entries arise as recurrences
- Advanced determinant calculus
- More calculations on determinant evaluations
- EVALUATING SOME DETERMINANTS OF MATRICES WITH RECURSIVE ENTRIES
- scientific article; zbMATH DE number 1244209 (Why is no real title available?)
- Proof of a conjecture on determinants of matrices whose entries arise as recurrences
- The determinants of matrices constructed by subdiagonal, main diagonal and superdiagonal
- The determinants of matrices with recursive entries
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
This page was built for publication: A symbolic evaluation of determinants of matrices with recursive entries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014074)