betaFeedback

WorksEngineering

Laguerre-MPPI

Abstract

Model Predictive Path Integral control (MPPI) is a sampling-based control method that handles nonlinear dynamics and non-convex costs without gradient information. Since MPPI samples the entire input sequence, longer prediction horizons lead to a higher-dimensional sampling space, potentially degrading control performance. This paper proposes Laguerre-MPPI, which parameterizes the control input sequence using discrete-time Laguerre basis functions and samples the basis coefficients. The resulting search dimension is independent of the prediction horizon. Hence, a longer prediction horizon does not require more samples to maintain the sampling density. For linear systems with quadratic costs, we derive a closed-loop stability condition in the infinite-sample limit. Under finite sampling, we provide a closed-form expression for the limit of the ratio of the effective sample size to the number of samples. We also show that the upper bound of this limit for Laguerre-MPPI is no lower than that for conventional MPPI. Numerical experiments demonstrate smoother inputs in obstacle avoidance and maintained performance over long horizons. Moreover, they verify the lower bound on the number of samples given by the finite-sample analysis.

Introduction

Model Predictive Path Integral control (MPPI) [1], [2] is a sampling-based Model Predictive Control (MPC) method. It updates the input by a weighted average of randomly generated input sequences, with exponential weights determined by the cost of each input sequence. MPPI has several advantages. Since MPPI requires no cost gradients, it directly handles nonlinear dynamics and non-convex or discontinuous costs. Since the computations for individual samples are independent, MPPI is implemented efficiently on GPUs. Furthermore, the input is updated using a weighted average of all samples, allowing information from the entire sample set to contribute to the update, unlike the random shooting method [3] and the cross-entropy method [4]. Hence the computed input sequence tends to be smoother than those of these methods. Owing to these advantages, MPPI has been applied to various control problems including whole-body control of legged robots [5], navigation of ground robots in cluttered and off-road environments [6], [7], agile flight and navigation of quadrotors [8], [9], aggressive driving on dirt tracks [10], [11], off-road driving over uneven terrain [12], [13], and motion planning for autonomous driving [14].

MPPI still has two open issues. One is the degradation of control performance with longer prediction horizons. Since MPPI samples input sequences over the prediction horizon, the search dimension grows linearly with the prediction horizon. Hence, when limited computational resources prevent increasing the number of samples, extending the horizon makes the samples sparse in the search space due to the curse of dimensionality [15], [16] and degrades control performance. In addition, when the number of samples is small relative to the search dimension, high-frequency components remain in the computed input and cause chattering and actuator wear [17]. Existing studies on this issue fall broadly into three categories: methods that design the sampling distribution to increase the number of effective samples [11], [18]–[20], methods that modify how samples are drawn without changing the distribution [21], [22], and methods that reduce the search dimension itself [5], [23].

The other issue for MPPI is the lack of theoretical guarantees, in particular stability and performance analysis for the closed-loop system. Existing research has focused on the evaluation of the sampling error [24], the convergence analysis of the optimization method [25], and the increase in free energy caused by constraint violations or imperfect tracking performance [11]. The stability of the closed-loop system is regarded as an open problem [26]. Yoon and Kim [27] treated finite-sample MPPI for linear systems as a perturbation of LQR and showed practical exponential stability in expectation. The number of samples required for their theory to hold remains unclear.

This paper develops a new control algorithm that reduces the search dimension of MPPI using Laguerre basis functions. We then analyze the stability of the resulting closed-loop system and the sampling accuracy with a finite number of samples. Laguerre basis functions form a discrete-time orthonormal basis and have been used in system identification [28] and in MPC to reduce the number of optimization variables [29]. Motivated by their use in MPC, we propose Laguerre-MPPI, which represents the sampled input of MPPI with Laguerre basis functions. Since Laguerre-MPPI samples the coefficients of the Laguerre basis instead of the input sequence, its search dimension is independent of the prediction horizon. Hence, extending the prediction horizon does not require more samples to maintain the sampling density. We derive a stability condition for the infinite-sample closed-loop system and show that closed-loop stability can be lost depending on the basis selection. To evaluate the sampling error under finite samples, we present the closed form of the covariance of the sampling error and the limit of the ratio of the effective sample size (ESS) to the number of samples. Based on these expressions, we provide a guideline on the number of samples required for the theory to hold, and show that the maximum of the asymptotic ESS ratio of Laguerre-MPPI over the initial estimate coefficient is no less than that of conventional MPPI.

The contributions of this paper are as follows.

  1. We expand the input in Laguerre basis functions and develop Laguerre-MPPI (Section III).

  1. For linear systems with quadratic costs, we translate the closed-loop behavior into the behavior of a stochastic dynamical system to derive the stability condition in the infinite-sample limit (Section IV).

  1. We derive the asymptotic covariance of the sampling error and the asymptotic ESS ratio in closed form, and give a lower bound on the number of samples. We then show that, regardless of the basis selection, the maximum of the asymptotic ESS ratio of Laguerre-MPPI over the initial estimate coefficient is no less than that of conventional MPPI (§ 10).

Notation: The m×mm \times m identity matrix is denoted by ImI_m, the Kronecker product by ⊗\otimes, the vector obtained by stacking the columns of a matrix by vec⁡(⋅)\operatorname{vec}(\cdot), the spectral radius by ρ(⋅)\rho(\cdot), the Kronecker delta by δij\delta_{ij}, and the inverse zz-transform by Z−1Z^{-1}. For a square matrix XX, its determinant is denoted by ∣X∣|X|, and its positive definiteness (positive semidefiniteness) by X≻0X \succ0 (X⪰0X \succeq0). For a vector zz and a matrix QQ, the weighted squared norm is defined by ∥z∥Q2:=zTQz\lVert z\rVert_Q^2 := z^{\mathsf{T}}Qz. We denote by N(μ,Σ)\mathcal{N}(\mu,\Sigma) the Gaussian distribution with mean μ\mu and covariance Σ\Sigma, and by EF[⋅]\mathbb{E}_{F}[\cdot] and Cov⁡F[⋅]\operatorname{Cov}_{F}[\cdot] the expectation and the covariance matrix with respect to a distribution FF. The probability density function of a distribution is denoted by the corresponding lowercase letter. The Kullback–Leibler divergence is defined by DKL(F∥H):=∫fln⁡(f/h) dXD_{\mathrm{KL}}(F\Vert H) := \int f \ln(f/h)\,\mathrm{d}X. Convergence in distribution is denoted by →d\xrightarrow{\mathrm{d}}, and almost sure convergence by a.s.

PRELIMINARIES: MPPI

Before presenting Laguerre-MPPI, we review the theory of MPPI on which it is built, following the information-theoretic derivation of Williams et al. [2].

Stochastic Optimal Control Problem

Consider a general discrete-time system of the form

x(k+1)=F(x(k),v(k)),x(0)=x0,(1)x(k+1) = F(x(k),v(k)), \qquad x(0) = x_0, \tag*{(1)}

where x(k)∈Rnx(k) \in\mathbb{R}^{n} is the state, v(k)∈Rmv(k) \in\mathbb{R}^{m} is the sampled input, and F:Rn×Rm→RnF:\mathbb{R}^{n} \times\mathbb{R}^{m} \to\mathbb{R}^{n} represents the system dynamics. The sampled input sequence up to the prediction horizon TT is denoted by

V:=[v(0) ⋯ v(T−1)]∈Rm×T.(2)V := [v(0)\ \cdots\ v(T-1)] \in\mathbb{R}^{m \times T}. \tag*{(2)}

The sampled input sequence VV is a random variable, and its columns v(k)v(k) independently follow the Gaussian distribution N(u(k),Σv)\mathcal{N}(u(k),\Sigma_v), with the mean input u(k)u(k) and covariance matrix Σv≻0\Sigma_v \succ0. The mean input sequence is denoted by

U:=[u(0) ⋯ u(T−1)]∈Rm×T.U := [u(0)\ \cdots\ u(T-1)] \in\mathbb{R}^{m \times T}.

Furthermore, we define the distribution of the sampled input sequence VV by QU:=N(U,Σv)\mathbb{Q}_{U} := \mathcal{N}(U,\Sigma_v), in which the columns v(k)v(k) independently follow N(u(k),Σv)\mathcal{N}(u(k),\Sigma_v), and call it the control distribution. The same notation is used for the other distributions of the sampled input sequence.

To derive the MPPI algorithm, we address the following stochastic optimal control problem.

Problem 1 (Stochastic Optimal Control):

min⁡U∈UEQU[ϕ(x(T))+∑k=0T−1Lk(x(k),u(k))],(3)\min_{U \in\mathcal{U}} \mathbb{E}_{\mathbb{Q}_{U}}\left[\phi(x(T))+\sum_{k=0}^{T-1}\mathcal{L}_k(x(k),u(k))\right], \tag*{(3)}

where ϕ(x(T))\phi(x(T)) is the terminal cost, Lk(x(k),u(k))\mathcal{L}_k(x(k),u(k)) is the stage cost of the state and input, and U\mathcal{U} is the feasible set of the mean input sequence UU.

Since this problem is intractable due to the implicit form of UU, we consider an approximation of it. We impose the following assumption.

Assumption 1: The stage cost Lk(x(k),u(k))\mathcal{L}_k(x(k),u(k)) is

Lk(x(k),u(k))=ck(x(k))+bk(u(k)),\mathcal{L}_k(x(k),u(k)) = c_k(x(k)) + b_k(u(k)),

where ck(x(k))c_k(x(k)) is the state cost, and bk(u(k))b_k(u(k)) is the input cost.

For brevity, we collect the state costs in (3) as

S(V):=ϕ(x(T))+∑k=0T−1ck(x(k)).(4)S(V) := \phi(x(T))+\sum_{k=0}^{T-1}c_k(x(k)). \tag*{(4)}

The state cost S:Rm×T→RS:\mathbb{R}^{m \times T} \to\mathbb{R} returns the cost of the trajectory generated from the sampled input sequence VV. Furthermore, we introduce the reference distribution Q~:=N(U~,Σv)\widetilde{\mathbb{Q}} := \mathcal{N}(\widetilde{U},\Sigma_v) with the reference input sequence U~\widetilde{U}, to which the control distribution QU\mathbb{Q}_{U} refers.

Free Energy and Relaxed Stochastic Optimal Control Problem

To solve (3)`` approximately, we introduce the free energy [30].

Definition 1 (Free energy): The following quantity is called the free energy of the control system composed of (1) and (3):

F(S,q~,λ):=−λln⁡(EQ~[exp⁡(−S(V)λ)]),(5)\mathcal{F}(S,\widetilde{q},\lambda) := -\lambda\ln\left(\mathbb{E}_{\widetilde{\mathbb{Q}}}\left[\exp\left(-\frac{S(V)}{\lambda}\right)\right]\right), \tag*{(5)}

where λ∈R+\lambda\in\mathbb{R}^{+} is called the temperature parameter.

Throughout this paper, we assume that the expectation in (5) is finite, which holds, e.g., when the state cost SS is bounded below.

We show that the free energy F\mathcal{F} is a lower bound of some cost function. To this end, we introduce an arbitrary probability distribution Q\mathbb{Q} of the sampled input sequence VV. Then, the following lemma holds.

Lemma 1: For any distribution Q\mathbb{Q}, the following inequality holds:

F(S,q~,λ)≤EQ[S(V)]+λDKL(Q∥Q~).(6)\mathcal{F}(S,\widetilde{q},\lambda) \leq\mathbb{E}_{\mathbb{Q}}[S(V)] + \lambda D_{\mathrm{KL}}(\mathbb{Q}\Vert\widetilde{\mathbb{Q}}). \tag*{(6)}

Proof: See Appendix A (see also [2]). ■

The first term on the right-hand side is the expected state cost, and the second term represents the discrepancy between the arbitrary distribution and the reference distribution through their KL divergence. Intuitively, the first term is interpreted as a state cost and the second term as an input cost. Hence, we let

J(Q):=EQ[S(V)]+λDKL(Q∥Q~).(7)J(Q) := \mathbb{E}_{Q}[S(V)] + \lambda D_{\mathrm{KL}}(Q\Vert\widetilde{Q}). \tag*{(7)}

Note that the cost function J(Q)J(Q) is defined for an arbitrary distribution QQ, not only for Gaussian distributions. To clarify the relation between the cost function J(Q)J(Q) and the objective function of Problem 1, we first impose the following assumption.

Assumption 2: The input cost bk(u(k))b_k(u(k)) is a quadratic function of the mean input u(k)u(k) given by

bk(u(k))=λ2(u(k)−u~(k))TΣv−1(u(k)−u~(k)).(8)b_k(u(k)) = \frac{\lambda}{2}(u(k)-\widetilde{u}(k))^{\mathsf{T}}\Sigma_v^{-1}(u(k)-\widetilde{u}(k)). \tag*{(8)}

With this preparation, the following lemma shows that (7) equals the cost function of (3).

Lemma 2: In the cost function J(Q)J(Q), let the reference distribution be Q~=N(U~,Σv)\widetilde{Q}=\mathcal{N}(\widetilde{U},\Sigma_v), and set the arbitrary distribution QQ to the control distribution QU=N(U,Σv)Q_U=\mathcal{N}(U,\Sigma_v). Under Assumptions 1 and 2, the following equation holds:

J(QU)=EQU[ϕ(x(T))+∑k=0T−1Lk(x(k),u(k))].J(Q_U)=\mathbb{E}_{Q_U}\left[\phi(x(T))+\sum_{k=0}^{T-1}\mathcal{L}_k(x(k),u(k))\right].

Proof: See Appendix B (see also [2]). ■

As stated in Lemma 2, Problem 1 is equivalently reduced to the following optimization problem over the set of control distributions G:={N(U,Σv)∣U∈U}\mathcal{G}:=\{\mathcal{N}(U,\Sigma_v)\mid U\in\mathcal{U}\} as

min⁡U∈UEQU[ϕ(x(T))+∑k=0T−1Lk(x(k),u(k))]=min⁡Q∈GJ(Q).(9)\min_{U\in\mathcal{U}}\mathbb{E}_{Q_U}\left[\phi(x(T))+\sum_{k=0}^{T-1}\mathcal{L}_k(x(k),u(k))\right]=\min_{Q\in\mathcal{G}}J(Q). \tag*{(9)}

By further removing the constraint Q∈GQ\in\mathcal{G}, we formulate the following stochastic optimal control problem, which is a relaxation of (9):

Problem 2 (Relaxed Stochastic Optimal Control):

Q∗=argmin⁡QJ(Q)Q^*=\mathop{\operatorname{argmin}}_{Q}J(Q)

Problem 2 is a variational problem of finding the distribution that attains the minimum cost without restricting the form of the distribution. Since the feasible set expands from the set G\mathcal{G} of control distributions to all distributions, the following inequality holds between Problem 2 and the original Problem 1:

min⁡QJ(Q)≤min⁡U∈UEQU[ϕ(x(T))+∑k=0T−1Lk(x(k),u(k))].\min_Q J(Q)\leq\min_{U\in\mathcal{U}}\mathbb{E}_{Q_U}\left[\phi(x(T))+\sum_{k=0}^{T-1}\mathcal{L}_k(x(k),u(k))\right].

Optimal Distribution

This subsection gives the solution of Problem 2 through the following lemma.

References

  1. [1]G. Williams, A. Aldrich, and E. A. Theodorou, “Model predictive path integral control: From theory to parallel computation,” J. Guid. Control Dyn., vol. 40, no. 2, pp. 344–357, 2017.DOI
  2. [2]G. Williams, P. Drews, B. Goldfain, J. M. Rehg, and E. A. Theodorou, “Information-theoretic model predictive control: Theory and applications to autonomous driving,” IEEE Trans. Robot., vol. 34, no. 6, pp. 1603–1622, 2018.arxiv.org/abs/1707.02342
  3. [3]P. Bakarać and M. Kvasnica, “Fast nonlinear model predictive control of a chemical reactor: A random shooting approach,” Acta Chimica Slovaca, vol. 11, pp. 175–181, 2018.DOI
  4. [4]M. Walker, D. Frisch, and U. D. Hanebeck, “Sample-efficient and smooth cross-entropy method model predictive control using deterministic samples,” in Proc. Amer. Control Conf. (ACC), 2026, pp. 4629–4636.arxiv.org/abs/2510.05706
  5. [5]J. Alvarez-Padilla, J. Z. Zhang, S. Kwok, J. M. Dolan, and Z. Manchester, “Real-time whole-body control of legged robots with model-predictive path integral control,” in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 2025, pp. 14721–14727.
  6. [6]I. S. Mohamed, K. Yin, and L. Liu, “Autonomous navigation of AGVs in unknown cluttered environments: Log-MPPI control strategy,” IEEE Robot. Autom. Lett., vol. 7, no. 4, pp. 10 240–10 247, 2022.arxiv.org/abs/2203.16599
  7. [7]X. Cai, S. Ancha, L. Sharma, P. R. Oosten, B. Bucher, S. Phillips, J. Wang, M. Everett, N. Roy, and J. P. How, “EVORA: Deep evidential traversability learning for risk-aware off-road autonomy,” IEEE Trans. Robot., vol. 40, pp. 3756–3777, 2024.arxiv.org/abs/2311.06234
  8. [8]M. Minařík, R. Pěnička, V. Vonášek, and M. Saska, “Model predictive path integral control for agile unmanned aerial vehicles,” in Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst. (IROS), 2024, pp. 13 144–13 151.arxiv.org/abs/2407.09812
  9. [9]Y. Zhai, R. Reiter, and D. Scaramuzza, “PA-MPPI: Perception-aware model predictive path integral control for quadrotor navigation in unknown environments,” IEEE Robot. Autom. Lett., vol. 11, no. 3, pp. 3804–3811, 2026.DOI
  10. [10]G. Williams, P. Drews, B. Goldfain, J. M. Rehg, and E. A. Theodorou, “Aggressive driving with model predictive path integral control,” in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 2016, pp. 1433–1440.DOI
  11. [11]M. S. Gandhi, B. Vlahov, J. Gibson, G. Williams, and E. A. Theodorou, “Robust model predictive path integral control: Analysis and performance guarantees,” IEEE Robot. Autom. Lett., vol. 6, no. 2, pp. 1423–1430, 2021.DOI
  12. [12]B. Vlahov, J. Gibson, D. D. Fan, P. Spieler, A.-a. Agha-mohammadi, and E. A. Theodorou, “Low frequency sampling in model predictive path integral control,” IEEE Robot. Autom. Lett., vol. 9, no. 5, pp. 4543–4550, 2024.DOI
  13. [13]T. Han, A. Liu, A. Li, A. Spitzer, G. Shi, and B. Boots, “Model predictive control for aggressive driving over uneven terrain,” in Proc. Robot.: Sci. Syst. (RSS), 2024.arxiv.org/abs/2311.12284
  14. [14]M. Teurgi, G. Elghalazy, and R. Frank, “Towards a safe real-time motion planning framework for autonomous driving systems: A model predictive path integral approach,” in Proc. Int. Conf. Robot., Autom. Artif. Intell. (RAAI), 2023, pp. 231–238.
  15. [15]T. Bengtsson, P. Bickel, and B. Li, “Curse-of-dimensionality revisited: Collapse of the particle filter in very large scale systems,” in Probability and Statistics: Essays in Honor of David A. Freedman, ser. IMS Collections. Beachwood, OH, USA: Inst. Math. Statist., 2008, vol. 2, pp. 316–335.DOI
  16. [16]S. Agapiou, O. Papaspiliopoulos, D. Sanz-Alonso, and A. M. Stuart, “Importance sampling: Intrinsic dimension and computational cost,” Stat. Sci., vol. 32, no. 3, pp. 405–431, 2017.arxiv.org/abs/1511.06196
  17. [17]P. Kički, “LP-MPPI: Low-pass filtering for efficient model predictive path integral control,” arXiv:2503.11717, 2025.
  18. [18]G. Williams, B. Goldfain, P. Drews, J. M. Rehg, and E. A. Theodorou, “Robust sampling based model predictive control with sparse objective information,” in Proc. Robot.: Sci. Syst. (RSS), 2018.DOI
  19. [20]J. Sacks and B. Boots, “Learning sampling distributions for model predictive control,” in Proc. Conf. Robot Learn. (CoRL), 2023, pp. 1733–1742.arxiv.org/abs/2212.02587
  20. [21]I. S. Mohamed, J. Xu, G. S. Sukhatme, and L. Liu, “Toward efficient MPPI trajectory generation with unscented guidance: U-MPPI control strategy,” IEEE Trans. Robot., vol. 41, pp. 1172–1192, 2025.DOI
  21. [22]T. Kim, G. Park, K. Kwak, J. Bae, and W. Lee, “Smooth model predictive path integral control without smoothing,” IEEE Robot. Autom. Lett., vol. 7, no. 4, pp. 10 406–10 413, 2022.DOI
  22. [23]F. Schramm, P. Fabre, N. P. Gilbert, and J. Carpentier, “Reference-free sampling-based model predictive control,” arXiv:2511.19204, 2025.arxiv.org/abs/2511.19204
  23. [24]H.-J. Yoon, C. Tao, H. Kim, N. Hovakimyan, and P. Voulgaris, “Sampling complexity of path integral methods for trajectory optimization,” in Proc. Amer. Control Conf. (ACC), 2022, pp. 3482–3487.arxiv.org/abs/2203.10067
  24. [25]Z. Yi, C. Pan, G. He, G. Qu, and G. Shi, “CoVO-MPC: Theoretical analysis of sampling-based MPC and optimal covariance design,” in Proc. Learn. Dyn. Control Conf. (L4DC), 2024, pp. 1122–1135.arxiv.org/abs/2401.07369
  25. [26]K. Honda, “Model predictive control via probabilistic inference: A tutorial and survey,” Annu. Rev. Control, vol. 61, p. 101052, 2026.arxiv.org/abs/2511.08019
  26. [27]H.-J. Yoon and H. Kim, “Finite-sample closed-loop stability of model predictive path integral control for linear time-invariant systems,” arXiv:2607.04006, 2026.arxiv.org/abs/2607.04006
  27. [28]B. Wahlberg, “System identification using Laguerre models,” IEEE Trans. Autom. Control, vol. 36, no. 5, pp. 551–562, 1991.
  28. [29]L. Wang, “Discrete time model predictive control design using Laguerre functions,” in Proc. Amer. Control Conf. (ACC), 2001, pp. 2430–2435.DOI
  29. [30]E. A. Theodorou and E. Todorov, “Relative entropy and free energy dualities: Connections to path integral and KL control,” in Proc. IEEE Conf. Decis. Control (CDC), 2012, pp. 1466–1473.
  30. [31]P. W. Broome, “Discrete orthonormal sequences,” Journal of the ACM (JACM), vol. 12, no. 2, pp. 151–168, 1965.
  31. [32]P. Van den Hof, B. Wahlberg, P. Heuberger, B. Ninness, J. Bokor, and T. Oliveira e Silva, “Modelling and identification with rational orthogonal basis functions,” IFAC Proc. Volumes, vol. 33, no. 15, pp. 445–455, 2000.
  32. [33]C. Tao, F. Wang, H. Jiang, J. He, Y. Chen, and Q. Bu, “Sampling strategy design for model predictive path integral control on legged robot locomotion,” arXiv:2601.01409, 2026.arxiv.org/abs/2601.01409
  33. [34]T. Howell, N. Gileadi, S. Tunyasuvunakool, K. Zakka, T. Erez, and Y. Tassa, “Predictive sampling: Real-time behaviour synthesis with MuJoCo,” arXiv:2212.00541, 2022.arxiv.org/abs/2212.00541
  34. [35]Y. Miyaoka and M. Inoue, “Agentic MPC for semantic control system resynthesis,” arXiv:2606.12774, 2026.
  35. [36]J. Geweke, “Bayesian inference in econometric models using Monte Carlo integration,” Econometrica, vol. 57, no. 6, pp. 1317–1339, 1989.DOI
  36. [37]A. B. Owen, “Monte Carlo Theory, Methods and Examples,” 2013. [Online]. Available: https://artowen.su.domains/mc/
  37. [38]A. Kong, “A note on importance sampling using standardized weights,” Dept. Statistics, Univ. Chicago, Tech. Rep. 348, 1992.
  38. [39]A. Das and D. Kempe, “Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection,” in Proc. Int. Conf. Mach. Learn. (ICML), 2011, pp. 1057–1064.arxiv.org/abs/1102.3975
  39. [40]A. W. van der Vaart, Asymptotic Statistics. Cambridge, U.K.: Cambridge Univ. Press, 1998.
  40. [41]B. D. O. Anderson and J. B. Moore, Optimal Filtering. Englewood Cliffs, NJ, USA: Prentice-Hall, 1979.
  41. [42]R. A. Horn and C. R. Johnson, Matrix Analysis, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2013.

Paper details

vlnc:W_mykwfbmx
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 2

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Engineering

Not recorded for this paper

View statement
Looking for related papers…
Contents