Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://reference.wolfram.com/language/ref/ArrayFlatten.html below:

ArrayFlatten—Wolfram Language Documentation

We deliver solutions for the AI era—combining symbolic computation, data-driven insights and deep technology expertise.

• Data & Computational Intelligence
• Model-Based Design
• Algorithm Development
• Wolfram|Alpha for Business
• Blockchain Technology
• Education Technology
• Quantum Computation

WolframConsulting.com

• See Also
  • Flatten
  • Join
  • Band
  • ArrayQ
  • ArrayDepth
  • ArrayPad
  • ImageApply
  • SubstitutionSystem
  • ArrayReduce
• Related Guides
  • Rearranging & Restructuring Lists
  • Constructing Matrices
  • Structure Matrices & Convolution Kernels
  • Computational Systems
  • Image Filtering & Neighborhood Processing
  • Handling Arrays of Data
  • Basic Image Manipulation
  • Iterated Maps & Fractals
• Tech Notes
  • Rearranging Nested Lists
  • Combining Lists
  • Structural Operations
  • Vectors and Matrices
  • Tensors

ArrayFlatten[{{m₁₁,m₁₂,…},{m₂₁,m₂₂,…},…}]

creates a single flattened matrix from a matrix of matrices m_{i j}.

ArrayFlatten[a,r]

flattens out r pairs of levels in the array a.

• ArrayFlatten requires that the blocks it flattens have dimensions that fit together.
• ArrayFlatten can be used to form block matrices from arrays of blocks.
• For a matrix of matrices, ArrayFlatten[a] yields a matrix whose elements are in the same order as in MatrixForm[a].
• ArrayFlatten[a] is normally equivalent to Flatten[a,{{1,3},{2,4}}]. »
• ArrayFlatten[a,r] is normally equivalent to Flatten[a,{{1,r+1},{2,r+2},…,{r,2r}}].
• For a tensor with rank 2r, ArrayFlatten[a,r] gives a tensor with rank r.
• In ArrayFlatten[{{m₁₁,m₁₂,…},{m₂₁,m₂₂,…},…}], all the matrices m_{i j} in the same row must have the same first dimension, and matrices m_{i j} in the same column must have the same second dimension.
• In general, in ArrayFlatten[a,r], all the k dimensions of a[[i₁,i₂,…,]] must be equal for each possible value of i_k .
• Elements at level r whose array depth is less than r are treated as scalars, and are replicated to fill out a rank-r array of the appropriate dimensions.
• ArrayFlatten works with SparseArray objects. »

Create a block matrix by flattening out a matrix of matrices:

Use 0s to represent zero matrices:

Flatten a rank-4 array to rank 2:

Flatten only the first four levels of a rank-6 array:

Flatten a rank 6 array to rank 3:

ArrayFlatten works with SparseArray objects:

Make a sparse matrix from a block matrix of SparseArray objects:

Put together many copies of a "tile":

Iterate a 2D substitution system:

Iterate a 3D substitution system:

Form an involutory matrix , such that :

Check that the resulting matrix is involutory:

Form a block matrix semidiscretization of the wave equation with n spatial points:

Differentiation matrix for second-order approximation of with periodic boundary conditions:

Identity matrix of size n:

Form block matrix a for system where :

Identity matrix of size 2 n:

Set up an initial condition vector for :

Approximate the solution at using the backward Euler method with time step k:

Show and at :

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4