Preconditioners in SciPy - Mini Project: Build & Apply

Using Preconditioners to Solve Linear Systems Efficiently

📖 Scenario: You work as a data scientist helping engineers solve large systems of linear equations quickly. These systems come from real-world problems like simulating airflow or electrical circuits.Sometimes, solving these systems directly takes too long. Preconditioners are tools that help speed up the solving process by improving the system's properties.

🎯 Goal: Build a Python program that creates a linear system, sets up a simple preconditioner, solves the system using an iterative solver with the preconditioner, and prints the solution.

📋 What You'll Learn

Create a sparse matrix representing the system

Create a right-hand side vector

Create a Jacobi preconditioner

Use the conjugate gradient solver with the preconditioner

Print the solution vector

💡 Why This Matters

🌍 Real World

Preconditioners are used in engineering and scientific computing to speed up solving large systems of equations from simulations and models.

💼 Career

Understanding preconditioners helps data scientists and engineers optimize numerical algorithms for faster and more stable solutions.

1

Create the linear system matrix and vector

Create a sparse matrix called A using scipy.sparse.diags with diagonals [4, -1, -1] and offsets [0, -1, 1] for size 5. Create a vector b as a NumPy array with values [1, 2, 3, 4, 5].

SciPy

# Create the sparse matrix A and vector b
# Your code here

Hint

Use diags to create a tridiagonal matrix with main diagonal 4 and -1 on the diagonals just above and below.

2

Create the Jacobi preconditioner

Create a diagonal preconditioner matrix M_inv as the inverse of the diagonal of A using scipy.sparse.diags. Extract the diagonal of A with A.diagonal() and invert it element-wise.

SciPy

import numpy as np
from scipy.sparse import diags

A = diags([4, -1, -1], [0, -1, 1], shape=(5, 5))
b = np.array([1, 2, 3, 4, 5])

# Create the Jacobi preconditioner M_inv
# Your code here

Hint

Get the diagonal of A with A.diagonal(). Then create M_inv with the inverse values on the diagonal.

3

Solve the system using conjugate gradient with preconditioner

Use scipy.sparse.linalg.cg to solve Ax = b with the preconditioner M_inv. Pass M_inv as the M argument. Store the solution vector in x.

SciPy

import numpy as np
from scipy.sparse import diags
from scipy.sparse.linalg import cg

A = diags([4, -1, -1], [0, -1, 1], shape=(5, 5))
b = np.array([1, 2, 3, 4, 5])

diag_A = A.diagonal()
M_inv = diags(1 / diag_A)

# Solve Ax = b using conjugate gradient with preconditioner M_inv
# Your code here

Hint

Call cg with A, b, and M=M_inv. Capture the solution in x.

4

Print the solution vector

Print the solution vector x using print(x).

SciPy

import numpy as np
from scipy.sparse import diags
from scipy.sparse.linalg import cg

A = diags([4, -1, -1], [0, -1, 1], shape=(5, 5))
b = np.array([1, 2, 3, 4, 5])

diag_A = A.diagonal()
M_inv = diags(1 / diag_A)

x, info = cg(A, b, M=M_inv)

# Print the solution vector x
# Your code here

Hint

Use print(x) to display the solution vector.

Practice

1.

What is the main purpose of a preconditioner in scipy when solving linear systems?

easy

A. To speed up the convergence of iterative solvers

B. To increase the size of the matrix

C. To change the solution of the system

D. To make the matrix non-square

Solution

1. Step 1: Understand the role of preconditioners

   Preconditioners are used to improve the efficiency of iterative methods by transforming the system into an easier one to solve.

2. Step 2: Identify the effect on convergence

   They help iterative solvers like Conjugate Gradient converge faster by approximating the inverse of the matrix.

3. Final Answer:

   To speed up the convergence of iterative solvers -> Option A

4. Quick Check:

   Preconditioner purpose = speed up convergence [OK]

Hint: Preconditioners help iterative solvers run faster [OK]

Common Mistakes:

• Thinking preconditioners change the solution
• Believing preconditioners increase matrix size
• Confusing preconditioners with matrix transformations that alter shape

2.

Which of the following is the correct way to create a simple Jacobi preconditioner using scipy.sparse.linalg.LinearOperator?

import numpy as np
from scipy.sparse.linalg import LinearOperator

A = np.array([[4, 1], [1, 3]])
M = LinearOperator(shape=A.shape, matvec=lambda x: ...)

easy

A. matvec=lambda x: x / np.diag(A)

B. matvec=lambda x: np.dot(A, x)

C. matvec=lambda x: x * np.diag(A)

D. matvec=lambda x: np.linalg.solve(A, x)

Solution

1. Step 1: Recall Jacobi preconditioner definition

   Jacobi preconditioner uses the inverse of the diagonal elements of matrix A.

2. Step 2: Implement matvec for Jacobi

   Applying the preconditioner means dividing each element of x by the corresponding diagonal element of A.

3. Final Answer:

   matvec=lambda x: x / np.diag(A) -> Option A

4. Quick Check:

   Jacobi preconditioner = divide by diagonal [OK]

Hint: Jacobi preconditioner divides vector by matrix diagonal [OK]

Common Mistakes:

• Using matrix multiplication instead of division
• Trying to solve full system instead of diagonal scaling
• Multiplying by diagonal instead of dividing

3.

Given the following code, what will be the output of print(M.matvec(b))?

import numpy as np
from scipy.sparse.linalg import LinearOperator

A = np.array([[2, 0], [0, 5]])
b = np.array([4, 10])
M = LinearOperator(shape=A.shape, matvec=lambda x: x / np.diag(A))
print(M.matvec(b))

medium

A. [0.5, 2.0]

B. [8.0, 50.0]

C. [2.0, 2.0]

D. [4.0, 10.0]

Solution

1. Step 1: Calculate diagonal of A

   Diagonal elements are [2, 5].

2. Step 2: Apply matvec function

   Divide each element of b by corresponding diagonal: [4/2, 10/5] = [2.0, 2.0].

3. Final Answer:

   [2.0, 2.0] -> Option C

4. Quick Check:

   Vector divided by diagonal = [2.0, 2.0] [OK]

Hint: Divide vector elements by diagonal elements to get output [OK]

Common Mistakes:

• Multiplying instead of dividing
• Confusing vector and matrix multiplication
• Using wrong diagonal values

4.

Identify the error in the following code that attempts to create a Jacobi preconditioner:

import numpy as np
from scipy.sparse.linalg import LinearOperator

A = np.array([[3, 1], [1, 4]])
M = LinearOperator(shape=A.shape, matvec=lambda x: np.diag(A) * x)
print(M.matvec(np.array([1, 2])))

medium

A. Using np.diag(A) incorrectly as a matrix

B. Multiplying by diagonal instead of dividing

C. Shape of LinearOperator is wrong

D. Input vector has wrong size

Solution

1. Step 1: Understand Jacobi preconditioner operation

   Jacobi preconditioner divides vector elements by diagonal elements of A.

2. Step 2: Check given matvec function

   Code multiplies vector by diagonal instead of dividing, which is incorrect.

3. Final Answer:

   Multiplying by diagonal instead of dividing -> Option B

4. Quick Check:

   Jacobi requires division, not multiplication [OK]

Hint: Jacobi preconditioner divides vector by diagonal, not multiply [OK]

Common Mistakes:

• Confusing multiplication with division
• Ignoring element-wise operations
• Not verifying mathematical definition

5.

You want to speed up solving a large sparse system Ax = b using Conjugate Gradient in scipy. Which approach best uses a preconditioner?

from scipy.sparse.linalg import cg, LinearOperator
import numpy as np

# A is large sparse matrix
# b is known vector

# Option 1: Use identity preconditioner
M1 = LinearOperator(A.shape, matvec=lambda x: x)

# Option 2: Use Jacobi preconditioner
diag = A.diagonal()
M2 = LinearOperator(A.shape, matvec=lambda x: x / diag)

# Option 3: Use incomplete Cholesky (not shown)

x, info = cg(A, b, M=M2)

Why is Option 2 preferred over Option 1?

hard

A. Because identity preconditioner is not a LinearOperator

B. Because identity preconditioner changes the solution

C. Because Jacobi preconditioner makes matrix larger

D. Because Jacobi preconditioner approximates inverse and speeds convergence

Solution

1. Step 1: Understand identity preconditioner effect

   Identity preconditioner does nothing; it returns the vector unchanged, so no speedup.

2. Step 2: Understand Jacobi preconditioner effect

   Jacobi approximates the inverse of the diagonal, improving convergence speed of iterative solver.

3. Final Answer:

   Because Jacobi preconditioner approximates inverse and speeds convergence -> Option D

4. Quick Check:

   Jacobi preconditioner = faster convergence [OK]

Hint: Jacobi preconditioner speeds up solver by approximating inverse [OK]

Common Mistakes:

• Thinking identity preconditioner changes solution
• Believing Jacobi increases matrix size
• Confusing LinearOperator requirements