Find link

language:

Find link is a tool written by Edward Betts.

searching for Linear algebra 45 found (2888 total)

alternate case: linear algebra

Reflection (mathematics) (1,154 words) [view diff] no match in snippet view article

In mathematics, a reflection (also spelled reflexion) is a mapping from a Euclidean space to itself that is an isometry with a hyperplane as the set of

Sheldon Axler (420 words) [view diff] exact match in snippet view article find links to article

shows how one can teach or learn linear algebra without the use of determinants. Axler later wrote a textbook, Linear Algebra Done Right (4th ed. 2024), to

Super vector space (1,893 words) [view diff] exact match in snippet view article find links to article

super vector spaces and their generalizations is sometimes called super linear algebra. These objects find their principal application in theoretical physics

Supergroup (physics) (615 words) [view diff] no match in snippet view article

The concept of supergroup is a generalization of that of group. In other words, every supergroup carries a natural group structure, but there may be more

DADiSP (737 words) [view diff] no match in snippet view article find links to article

DADiSP (Data Analysis and Display, pronounced day-disp) is a numerical computing environment developed by DSP Development Corporation which allows one

DADiSP (737 words) [view diff] no match in snippet view article find links to article

DADiSP (Data Analysis and Display, pronounced day-disp) is a numerical computing environment developed by DSP Development Corporation which allows one

E. F. Robertson (372 words) [view diff] case mismatch in snippet view article find links to article

Linear Algebra – with T.S.Blyth, 1986, ISBN 978-0412278501 Essential Student Algebra: Groups – with T.S.Blyth, 1986, ISBN 978-0412278402 Basic Linear

Alfred Inselberg (435 words) [view diff] exact match in snippet view article find links to article

in 1959, for the visualization of multidimensional geometries (as in linear algebra) and multivariate problems. Inselberg was born in Athens, Greece. Later

Supercommutative algebra (322 words) [view diff] no match in snippet view article find links to article

In mathematics, a supercommutative (associative) algebra is a superalgebra (i.e. a Z2-graded algebra) such that for any two homogeneous elements x, y we

Involution (mathematics) (2,240 words) [view diff] exact match in snippet view article

projective geometry is a polarity that is a correlation of period 2. In linear algebra, an involution is a linear operator T on a vector space, such that T2

Undergraduate Texts in Mathematics (4,190 words) [view diff] case mismatch in snippet view article find links to article

Intermediate Calculus. ISBN 978-0-387-96058-6. Curtis, Charles W. (1984). Linear Algebra: An Introductory Approach. ISBN 978-0-387-90992-9. Driver, R.D. (1984)

Bryan Shader (268 words) [view diff] case mismatch in snippet view article find links to article

Editor-in-chief of the Electronic Journal of Linear Algebra. He is also Associate Editor of other two journals, Linear Algebra and its Applications (since 2003)

Supermodule (868 words) [view diff] exact match in snippet view article find links to article

module over a superring or superalgebra. Supermodules arise in super linear algebra which is a mathematical framework for studying the concept supersymmetry

Witt's theorem (564 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-0-387-72487-4, Zbl 1130.12001 Roman, Stephen (2008), Advanced Linear Algebra, Graduate Texts in Mathematics (Third ed.), Springer, ISBN 978-0-387-72828-5

Berezinian (802 words) [view diff] no match in snippet view article find links to article

In mathematics and theoretical physics, the Berezinian or superdeterminant is a generalization of the determinant to the case of supermatrices. The name

Monad (homological algebra) (170 words) [view diff] no match in snippet view article

In homological algebra, a monad is a 3-term complex A → B → C of objects in some abelian category whose middle term B is projective, whose first map A → B

Monad (homological algebra) (170 words) [view diff] no match in snippet view article

In homological algebra, a monad is a 3-term complex A → B → C of objects in some abelian category whose middle term B is projective, whose first map A → B

Backfitting algorithm (2,015 words) [view diff] no match in snippet view article find links to article

In statistics, the backfitting algorithm is a simple iterative procedure used to fit a generalized additive model. It was introduced in 1985 by Leo Breiman

Mathematical visualization (764 words) [view diff] no match in snippet view article find links to article

Mathematical phenomena can be understood and explored via visualization. Classically, this consisted of two-dimensional drawings or building three-dimensional

Classification theorem (650 words) [view diff] exact match in snippet view article find links to article

descriptions of redirect targetss (by dimension) Rank–nullity theorem – In linear algebra, relation between 3 dimensions (by rank and nullity) Structure theorem

Anna Johnson Pell Wheeler (1,019 words) [view diff] exact match in snippet view article find links to article

was an American mathematician. She is best known for early work on linear algebra in infinite dimensions, which has later become a part of functional

Scientific Research Publishing (1,112 words) [view diff] no match in snippet view article find links to article

Scientific Research Publishing (SCIRP) is a predatory academic publisher of open-access electronic journals, conference proceedings, and scientific anthologies

Notation in probability and statistics (1,502 words) [view diff] no match in snippet view article find links to article

Probability theory and statistics have some commonly used conventions, in addition to standard mathematical notation and mathematical symbols. Random variables

Method of Four Russians (590 words) [view diff] no match in snippet view article find links to article

In computer science, the Method of Four Russians or "The Four-Russians speedup," is a technique for speeding up algorithms involving Boolean matrices,

NAG Numerical Library (487 words) [view diff] exact match in snippet view article find links to article

mathematical and statistical algorithms. Areas covered by the library include linear algebra, optimization, quadrature, the solution of ordinary and partial differential

Thales's theorem (2,130 words) [view diff] no match in snippet view article find links to article

In geometry, Thales's theorem states that if A, B, and C are distinct points on a circle where the line AC is a diameter, the angle ∠ ABC is a right angle

Canonical form (1,895 words) [view diff] case mismatch in snippet view article find links to article

2019-11-20. Shilov, Georgi E. (1977), Silverman, Richard A. (ed.), Linear Algebra, Dover, ISBN 0-486-63518-X. Hansen, Vagn Lundsgaard (2006), Functional

James Munkres (276 words) [view diff] case mismatch in snippet view article find links to article

Elementary Differential Topology. He is also the author of Elementary Linear Algebra. Munkres completed his undergraduate education at Nebraska Wesleyan

Robert J. Plemmons (1,824 words) [view diff] exact match in snippet view article find links to article

mid-to-late 1980s until mid 1990s, his research focused on numerical linear algebra, specifically in Matrix Theory with applications in Markov chains and

Poisson superalgebra (292 words) [view diff] no match in snippet view article find links to article

In mathematics, a Poisson superalgebra is a Z2-graded generalization of a Poisson algebra. Specifically, a Poisson superalgebra is an (associative) superalgebra

Sinkhorn's theorem (707 words) [view diff] case mismatch in snippet view article find links to article

Wolf, Michael M. (2015). "Sinkhorn normal form for unitary matrices". Linear Algebra and Its Applications. 471: 76–84. arXiv:1408.5728. doi:10.1016/j.laa

Index calculus algorithm (1,720 words) [view diff] exact match in snippet view article find links to article

relations among the discrete logarithms of small primes, computes them by a linear algebra procedure and finally expresses the desired discrete logarithm with

DIIS (949 words) [view diff] no match in snippet view article find links to article

DIIS (direct inversion in the iterative subspace or direct inversion of the iterative subspace), also known as Pulay mixing, is a technique for extrapolating

List of lemmas (525 words) [view diff] no match in snippet view article find links to article

This following is a list of lemmas (or, "lemmata", i.e. minor theorems, or sometimes intermediate technical results factored out of proofs). See also list

Poincaré separation theorem (391 words) [view diff] no match in snippet view article find links to article

In mathematics, the Poincaré separation theorem, also known as the Cauchy interlacing theorem, gives some upper and lower bounds of eigenvalues of a real

Speakeasy (computational environment) (2,764 words) [view diff] no match in snippet view article

Speakeasy was a numerical computing interactive environment also featuring an interpreted programming language. It was initially developed for internal

ScaLAPACK (319 words) [view diff] exact match in snippet view article find links to article

Slate is written in C++ and was designed primarily to serve as a dense linear algebra library to the United States Department of Energy and to the high-performance

Eigenmode expansion (967 words) [view diff] no match in snippet view article find links to article

Eigenmode expansion (EME) is a computational electrodynamics modelling technique. It is also referred to as the mode matching technique or the bidirectional

Nested dissection (504 words) [view diff] no match in snippet view article find links to article

In numerical analysis, nested dissection is a divide and conquer heuristic for the solution of sparse symmetric systems of linear equations based on graph

N! conjecture (561 words) [view diff] no match in snippet view article find links to article

In mathematics, the n! conjecture is the conjecture that the dimension of a certain bi-graded module of diagonal harmonics is n!. It was made by A. M.

Commensurability (group theory) (865 words) [view diff] exact match in snippet view article

{\displaystyle \langle b\rangle } . There is an analogous notion in linear algebra: two linear subspaces S and T of a vector space V are commensurable

Dune (mathematics software) (402 words) [view diff] exact match in snippet view article

dune-common, geometry classes: dune-geometry, grid interface: dune-grid, linear algebra classes: dune-istl, local ansatz functions: dune-localfunctions. In

SLEPc (421 words) [view diff] no match in snippet view article find links to article

SLEPc is a software library for the parallel computation of eigenvalues and eigenvectors of large, sparse matrices. It can be seen as a module of PETSc

Farkas' lemma (3,003 words) [view diff] exact match in snippet view article find links to article

lemma" since it contains only equalities. Its proof is an exercise in linear algebra. There are also Farkas-like lemmas for integer programs.: 12--14 For

Nullity theorem (392 words) [view diff] case mismatch in snippet view article find links to article

inverse. Gustafson, William H. (1984), "A note on matrix inversion", Linear Algebra and Its Applications, 57: 71–73, doi:10.1016/0024-3795(84)90177-0, ISSN 0024-3795