Span
One word, taught differently in 2 fields. Each use is given apart.
In Engineering
The set of all linear combinations of a given set of vectors.
In Systems & CS
The longest path of execution dependencies in a parallel computation.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
In Engineering
3Each in their own terms, from the easiest level.
Bernhard Boser & Gireeja Ranade
The span of a set of vectors is the set of all vectors that can be written as a linear combination of those vectors.Valerie Hower
The span of a collection of vectors is the set of all possible linear combinations of those vectors, which forms a subspace.Gilbert Strang
The space spanned by a set of vectors is the space consisting of all linear combinations of those vectors.
In Systems & CS
2Each in their own terms, from the easiest level.
Charles Leiserson & Julian Shun
The longest directed path in a computation graph, denoted as , also called critical-path length or computational depth.Julian Shun
The longest path of dependencies in a parallel algorithm, representing the minimum time required on an infinite number of processors.
Lectures that assume it
16The first 12 are shown.
- QR Factorization & Least-Squares Approximation of Overdetermined Systems
- The Fourier Expansion and Basic Formulas
- Cache-Oblivious Algorithms
- Matrix Spaces; Rank 1; Small World Graphs
- Linear Transformations in Geometry
- Linear Algebra Review: Range, Nullspace & Matrix Factorizations
- Singular Value Decomposition
- Operational Amplifiers and Negative Feedback
- Generalized Eigenvectors, Diagonalization, and Jordan Canonical Form
- Convex Optimization II: Sequential Convex Programming and Conjugate Gradient Methods
- Convex Optimization II: Conjugate Gradient and Truncated Newton Methods
- Linear Algebra: The Dimension of a Subspace
Connections
33The lectures that define it or assume it, and the concepts next to it.
Concepts8
Show 2 moreShow fewer
Lectures25
- Independence, Basis, and Dimension
- Parallel Storage Allocation
- Races and Parallelism
- Linear Algebra: Bases and Linear Independence
- Linear Algebra: The Span of Vectors in R^n
- Analysis of Multithreaded Algorithms
Show 19 moreShow fewer
- Matrix Multiplication and State-Transition Systems
- Linear Independence, Span, and Null Spaces
- Nodal Analysis and Resistive Networks
- QR Factorization & Least-Squares Approximation of Overdetermined Systems
- The Fourier Expansion and Basic Formulas
- Cache-Oblivious Algorithms
- Matrix Spaces; Rank 1; Small World Graphs
- Linear Transformations in Geometry
- Linear Algebra Review: Range, Nullspace & Matrix Factorizations
- Singular Value Decomposition
- Operational Amplifiers and Negative Feedback
- Generalized Eigenvectors, Diagonalization, and Jordan Canonical Form
- Convex Optimization II: Sequential Convex Programming and Conjugate Gradient Methods
- Convex Optimization II: Conjugate Gradient and Truncated Newton Methods
- Linear Algebra: The Dimension of a Subspace
- Linear Algebra: Orthogonal Projections and Orthonormal Bases
- Gram-Schmidt Process and QR Factorization
- Voltage Dividers, Equivalent Resistance, and Touchscreens
- Thévenin and Norton Equivalent Circuits