LinBox

swMATH522MaRDI QIDQ13277FDOQ13277

Author name not available (Why is that?)

Cited In (39)

• Computing the Chern-Schwartz-MacPherson Class of complete simplical toric varieties
• Title not available (Why is that?)
• On the cohomology of linear groups over imaginary quadratic fields
• PASCO'07. Proceedings of the 2007 international workshop on parallel symbolic computation, London, ON, Canada, July 27--28, 2007.
• Faster inversion and other black box matrix computations using efficient block projections
• Faster geometric algorithms via dynamic determinant computation
• An output-sensitive algorithm for persistent homology
• Solving very sparse rational systems of equations
• Fast computation of Hermite normal forms of random integer matrices
• Solving sparse rational linear systems
• Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
• Cohomology with twisted one-dimensional coefficients for congruence subgroups of \(\operatorname{SL}_4(\mathbb{Z})\) and Galois representations
• Simultaneous conversions with the residue number system using linear algebra
• Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
• An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\)
• Krylov subspace methods in finite precision: A unified approach
• LinBox founding scope allocation, parallel building blocks, and separate compilation
• An introspective algorithm for the integer determinant
• Title not available (Why is that?)
• FFPACK
• On the performance of parametric polymorphism in Maple
• Generic matrix multiplication and memory management in LinBox
• Fast matrix decomposition in \(\mathbb F_2\)
• Proceedings of the 2005 international symposium on symbolic and algebraic computation, ISSAC'05, Beijing, China, July 24--27, 2005.
• Block-Krylov techniques in the context of sparse-FGLM algorithms
• Smith normal form of dense integer matrices fast algorithms into practice
• Classification of three-dimensional integrable scalar discrete equations
• Advanced determinant calculus: a complement
• Elements of design for containers and solutions in the LinBox library (extended abstract)
• Time and space efficient generators for quasiseparable matrices
• Title not available (Why is that?)
• Relaxed \(p\)-adic Hensel lifting for algebraic systems
• Employing C++ templates in the design of a computer algebra library
• CAPD::RedHom v2 -- homology software based on reduction algorithms
• GBLA: Gröbner basis linear algebra package
• Vector rational number reconstruction
• Recursive double-size fixed precision arithmetic
• Collaborative computer algebra
• Experimental evidence for Maeda's conjecture on modular forms

This page was built for software: LinBox