Gaussian elimination is not optimal
From MaRDI portal
Publication:2536323
DOI10.1007/BF02165411zbMath0185.40101WikidataQ21694537 ScholiaQ21694537MaRDI QIDQ2536323
Publication date: 1969
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131927
Analysis of algorithms and problem complexity (68Q25) Complexity and performance of numerical algorithms (65Y20)
Related Items (only showing first 100 items - show all)
Computing matrix-valued Nevanlinna-Pick interpolation ⋮ On the complexity of integer matrix multiplication ⋮ Fast operations on linearized polynomials and their applications in coding theory ⋮ Fast rectangular matrix multiplication and QR decomposition ⋮ On the exponent of all pairs shortest path problem ⋮ Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures ⋮ Using Strassen's matrix multiplication in high performance solution of linear systems ⋮ Rectangular matrix multiplication revisited ⋮ Parallel evaluation of arithmetic circuits ⋮ A non-commutative cryptosystem based on quaternion algebras ⋮ Why does deep and cheap learning work so well? ⋮ Variational Bayesian least squares: an application to brain-machine interface data ⋮ A note on counting independent terms in asymptotic expressions of computational complexity ⋮ On the complexity of the multiplication of matrices of small formats ⋮ Fast matrix multiplication by using color algebras ⋮ Postulation of general quintuple fat point schemes in \(\mathbb P^3\) ⋮ On the complexity of computing bilinear forms with \(\{0,1\}\) constants ⋮ Extending the four Russians' bound to general matrix multiplication ⋮ Computational methods of linear algebra ⋮ On the control of structural models ⋮ Shortest-path problem is not harder than matrix multiplication ⋮ The tensor rank of tensor product of two three-qubit W states is eight ⋮ Tensor rank is not multiplicative under the tensor product ⋮ Clustering large attributed information networks: an efficient incremental computing approach ⋮ Complexity measures for matrix multiplication algorithms ⋮ Relations between exact and approximate bilinear algorithms. Applications ⋮ Accelerating Viterbi algorithm on graphics processing units ⋮ The bit-operation complexity of matrix multiplication and of all pair shortest path problem ⋮ The matrix capacity of a tensor ⋮ On the algorithmic complexity of associative algebras ⋮ New combinations of methods for the acceleration of matrix multiplication ⋮ Probabilistic algorithms and straight-line programs for some rank decision problems ⋮ Plethysm and fast matrix multiplication ⋮ Fast structured matrix computations: tensor rank and Cohn-Umans method ⋮ A fast algorithm for finding all shortest paths ⋮ Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication ⋮ A note on 'Is shortest path problem not harder than matrix multiplication?' ⋮ Entropy controlled Laplacian regularization for least square regression ⋮ The computational complexity of a set of quadratic functions ⋮ Computing the sign or the value of the determinant of an integer matrix, a complexity survey. ⋮ Efficient parallel algorithms for linear recurrence computation ⋮ Computing lower bounds on tensor rank over finite fields ⋮ Fast matrix multiplication without APA-algorithms ⋮ The complexity of partial derivatives ⋮ On the asymptotic complexity of rectangular matrix multiplication ⋮ A DEMATEL-based completion method for incomplete pairwise comparison matrix in AHP ⋮ Discrete convolution with modulo operations ⋮ An implicit algorithm for validated enclosures of the solutions to variational equations for ODEs ⋮ An ultrafast cellular method for matrix multiplication ⋮ On practical algorithms for accelerated matrix multiplication ⋮ Superfast algorithms for Cauchy-like matrix computations and extensions ⋮ Multilinear algebra and parallel programming ⋮ Inverse linear difference operators ⋮ Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth ⋮ Comparisons of Gaussian elimination algorithms on a Cray Y-MP ⋮ A lower bound for the multiplication of polynomials modulo a polynomial ⋮ A segregated approach for modeling the electrochemistry in the 3-D microstructure of li-ion batteries and its acceleration using block preconditioners ⋮ Memory-usage advantageous block recursive matrix inverse ⋮ Convolution accelerator designs using fast algorithms ⋮ An optimized differential step-size LMS algorithm ⋮ Essentially optimal computation of the inverse of generic polynomial matrices ⋮ Algebraic methods in the congested clique ⋮ An algorithm for testing chordality of graphs ⋮ Optimum computation of p bilinear forms ⋮ Beyond the Alder-Strassen bound. ⋮ On a Newton-Moser type method ⋮ On the implementation of Strassen's fast multiplication algorithm ⋮ A survey of techniques in applied computational complexity ⋮ Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation ⋮ An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications ⋮ Realizing Boolean functions on disjoint sets of variables ⋮ An algebraic approach for reasoning about information flow ⋮ The singularity attack to the multivariate signature scheme HIMQ-3 ⋮ A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices ⋮ Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics ⋮ Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms ⋮ The complexity of group algebra computations ⋮ Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 ⋮ Optimisation of complex integration contours at higher order ⋮ The Fast Fourier Transform by polynomial evaluation ⋮ A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications ⋮ Recognition of EOL languages in less than quartic time ⋮ A simple proof of Strassen's result ⋮ \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication ⋮ A fast algorithm for all-pairs Hamming distances ⋮ A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\) ⋮ Computing the depth distribution of a set of boxes ⋮ Determinisability of unary weighted automata over the rational numbers ⋮ Fast rectangular matrix multiplication and applications ⋮ A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications ⋮ An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\) ⋮ Non-cancellative Boolean circuits: A generalization of monotone boolean circuits ⋮ A simple complexity proof for a polynomial-time linear programming algorithm ⋮ Randomised algorithms ⋮ Why does information-based complexity use the real number model? ⋮ Algorithms for exponentiation in finite fields ⋮ Algorithms for fast convolutions on motion groups ⋮ An optimum partition for inverting a nonsingular matrix ⋮ FFT-like multiplication of linear differential operators ⋮ Self-testing/correcting with applications to numerical problems
Cites Work
This page was built for publication: Gaussian elimination is not optimal
