Search results

A [[Basis (linear algebra)|basis]] is a maximal linearly independent set: equivalently, a linearly in

...uthorlink=Brian Hartley | coauthors=T.O. Hawkes | title=Rings, modules and linear algebra | publisher=Chapman and Hall | year=1970 | isbn=0-412-09810-5 }}

{{r|Linear algebra}}

{{r|Linear algebra}}

In [[mathematics]], especially in [[linear algebra]], Gram-Schmidt orthogonalization is a sequential procedure or [[algorithm] #H. Anton and C. Rorres, ''Elementary Linear Algebra with Applications'' (9 ed.), Wiley, 2005.

{{r|Basis (linear algebra)}}

...g the [[.NET Framework]] with n-dimensional arrays, [[Complex numbers]], [[Linear algebra]], [[fast Fourier transform]] and plotting controls (2D and 3D), ILNumerics

{{r|Basis (linear algebra)}}

In [[linear algebra]], a '''basis''' for a [[vector space]] <math>V</math> is a set of [[vector

...uter.rl.ac.uk/cuter-www/ CUTEr] - testing environment for optimization and linear algebra solvers

In [[linear algebra]] the '''minimal polynomial''' of an algebraic object is the [[monic polyno

{{r|Linear algebra}}

{{r|Basis (linear algebra)}}

{{r|Linear algebra}}

{{r|Linear algebra}}

{{r|Linear algebra}}

In [[linear algebra]], a '''complement''' to a subspace of a vector space is another subspace w

The remaining Asset Classes are used in a [[linear algebra model]] to construct an Efficient Frontier. Essentially, all potential inve

In [[linear algebra]], a '''Moore matrix''', named after [[E. H. Moore]], is a [[determinant]]

* The [[characteristic polynomial]] in [[linear algebra]].