Talk:Determinant
Determinant has been listed as a level4 vital article in Mathematics. If you can improve it, please do. This article has been rated as BClass. 
WikiProject Mathematics  (Rated Bclass, Topimportance)  


Archives 


Sources for development of this article may be located at "determinant" matrix – news · newspapers · books · scholar · JSTOR · free images 
Contents
Right handed coordinante
the following sentence is not clear. "The determinant of a set of vectors is positive if the vectors form a righthanded coordinate system, and negative if lefthanded." what does "righthanded coordinate system" means? the "coordinate system" article does not mention it. amit man
Possible to do/see also items
linear algebra/analytic geometry
linear independence/collinearity, Gram determinant, tensor, positive definite matrix (Sylvester's criterion), defining a plane, Lineline intersection, Cayley–Hamilton_theorem, cross product, Matrix representation of conic sections, adjugate matrix, similar matrix have same det (Similarity invariance), Cauchy–Binet formula, Trilinear_coordinates, Trace diagram, Pfaffian
types of matrices
special linear group, special orthogonal group, special unitary group, indefinite special orthogonal group, modular group, unimodular matrix, matrices with multidimensional indices
number theory/algebra
Pell's equation/continued fraction?, discriminant, Minkowski's theorem/lattice, Partition_(number_theory), resultant, field norm, Dirichlet's_unit_theorem, discriminant of an algebraic number field
geometry, analysis
conformal map?, Gauss curvature, orientability, Integration by substitution, Wronskian, invariant theory, Monge–Ampère equation, Brascamp–Lieb_inequality, Liouville's formula, absolute value of cx numbers and quaternions (see 3sphere), distance geometry (Cayley–Menger determinant), Delaunay_triangulation
open questions
Jacobian conjecture, Hadamard's maximal determinant problem
algorithms
polar decomposition, QR decomposition, Dodgson_condensation, Matrix_determinant_lemma, eigendecomposition a few papers: Monte carlo for sparse matrices, approximation of det of large matrices, The Permutation Algorithm for NonSparse Matrix Determinant in Symbolic Computation, DETERMINANT APPROXIMATIONS
examples
reflection matrix, Rotation matrix, Vandermonde matrix, Circulant matrix, Hessian matrix (Blob_detection#The_determinant_of_the_Hessian), block matrix, Gram determinant, Elementary_matrix, Orr–Sommerfeld_equation, det of Cartan matrix
generalizations
Hyperdeterminant, Quasideterminant, Continuant (mathematics), Immanant of a matrix, permanent, Pseudodeterminant, det's of infinite matrices / regularized det / functional determinant (see also operator theory), Fredholm determinant, superdeterminant
other
Determinantal point process, Kirchhoff's theorem,
books
[1]
Decomposition Methods
The article in general seems to be packed full of overly complicated ways of doing simple things. For instance the Decomposition Methods section fails to mention Gaussian Elimination (yes, it is mentioned in the Further Methods section). It makes no sense to me (so either I don't understand or the section is simply wrong) that det(A) = e*det(L)*det(U) given that det(A) = det(L') = det(U') for the upper triangular matrix U' and the lower triangular matrix L' that are EASILY arrived at (order O ~ n^3) by Gaussian Elimination. In other words, given how easy and efficient Gaussian Elimination is, LU Decomposition, etc. should be clearly justified here, and it is (they are) not. I also note the Wikiarticle on Gaussian Elimination claims right up front that it operates on Rows of a matrix. This is just WRONG, it can operate on either Rows or Columns and if memory serves me (it may not) it can operate on both. Restricting discussion to row reduction is nonsense. Anyway, my main point is why should LU decomposition be mentioned here if it is MORE EXPENSIVE than Gaussian Elimination? Before discussing its details, that needs to be addressed  since as far as I can see it is only useful for reasons other than calculation of the determinant of a matrix.98.21.212.196 (talk) 22:55, 27 May 2017 (UTC)
 umm, dude, the usual LU decomposition *is* gaussian elimination  U is the resulting row echelon form, L contains the sequence of pivot multipliers used during the elimination procedure. Which, btw, is generally done on rows because the RHS of a set of simultaneous equations  used to augment a matrix to solve those equations, which was the whole *point* of gaussian elimination  adds one or more additional columns (not rows), so the corresponding elimination procedure must act on rows. — Preceding unsigned comment added by 174.24.230.124 (talk) 06:26, 1 June 2017 (UTC)
External links modified
Hello fellow Wikipedians,
I have just modified 2 external links on Determinant. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 Added archive https://web.archive.org/web/20120910034016/http://darkwing.uoregon.edu/~vitulli/441.sp04/LinAlgHistory.html to http://darkwing.uoregon.edu/~vitulli/441.sp04/LinAlgHistory.html
 Corrected formatting/usage for http://www.matrixanalysis.com/DownloadChapters.html
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
You may set the checked=
, on this template, to true or failed to let other editors know you reviewed the change. If you find any errors, please use the tools below to fix them or call an editor by setting needhelp=
to your help request.
 If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
 If you found an error with any archives or the URLs themselves, you can fix them with this tool.
If you are unable to use these tools, you may set needhelp=<your help request>
on this template to request help from an experienced user. Please include details about your problem, to help other editors.
Cheers.—InternetArchiveBot (Report bug) 14:05, 9 September 2017 (UTC)