tfp.experimental.fastgp.partial_lanczos.psd_solve_multishift
Stay organized with collections
Save and categorize content based on your preferences.
Solve (A - shift_k I) x_k = v for PSD A.
View aliases
Main aliases
`tfp.experimental.fastgp.fast_gp.fast_log_det.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.fast_gp.fast_log_det.preconditioners.linalg.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.fast_gp.preconditioners.linalg.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.fast_log_det.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.fast_log_det.preconditioners.linalg.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.fast_mtgp.fast_gp.fast_log_det.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.fast_mtgp.fast_gp.fast_log_det.preconditioners.linalg.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.fast_mtgp.fast_gp.preconditioners.linalg.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.fast_mtgp.fast_log_det.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.fast_mtgp.fast_log_det.preconditioners.linalg.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.fast_mtgp.preconditioners.linalg.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.linalg.partial_lanczos.psd_solve_multishift`, `tfp.experimental.fastgp.preconditioners.linalg.partial_lanczos.psd_solve_multishift`
tfp.experimental.fastgp.partial_lanczos.psd_solve_multishift(
multiplier: Callable[[tfp.experimental.fastgp.fast_gp.Array], tfp.experimental.fastgp.fast_gp.Array],
v: tfp.experimental.fastgp.fast_gp.Array,
shifts: tfp.experimental.fastgp.fast_gp.Array,
key: tfp.experimental.fastgp.fast_gp.Array,
num_iters: int = 20
) -> tfp.experimental.fastgp.fast_gp.Array
Args |
multiplier
|
A function for left matrix multiplying by an n by n
symmetric positive definite matrix A.
|
v
|
A tensor of shape (n, t) representing t n-dim vectors.
|
shifts
|
A tensor of shape (s) representing s distinct scalar shifts.
|
key
|
A random seed.
|
num_iters
|
The number of iterations to run the Lanczos tridiagonalization
algorithm for.
|
Returns |
|
A tensor x of shape (s, t, n) that approximately satisfies
(A - shift[i] I) x[i, j, :] = v[:, j]
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2026-11-05 UTC.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2026-11-05 UTC."],[],[]]