scholarly journals Computing the Fréchet Derivative of the Matrix Logarithm and Estimating the Condition Number

2013 ◽  
Vol 35 (4) ◽  
pp. C394-C410 ◽  
Author(s):  
Awad H. Al-Mohy ◽  
Nicholas J. Higham ◽  
Samuel D. Relton
Keyword(s):  
Condition Number ◽  
Fréchet Derivative ◽  
Frechet Derivative ◽  
Matrix Logarithm ◽  
The Matrix

scholarly journals On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

2021 ◽  
Author(s):  
Alice Cortinovis ◽  
Daniel Kressner
Keyword(s):  
Large Scale ◽  
Gaussian Process Regression ◽  
Likelihood Estimation ◽  
Random Vectors ◽  
Symmetric Positive Definite ◽  
Matrix Logarithm ◽  
The Matrix ◽  
Trace Estimation ◽  
Scale Matrix ◽  
Existing Result

AbstractRandomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of $$x^T Bx$$ x T B x for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number of applications give rise to indefinite B. Most notably, this is the case for log-determinant estimation, a task that features prominently in statistical learning, for instance in maximum likelihood estimation for Gaussian process regression. The analysis of randomized trace estimates, including tail bounds, has mostly focused on the SPD case. In this work, we derive new tail bounds for randomized trace estimates applied to indefinite B with Rademacher or Gaussian random vectors. These bounds significantly improve existing results for indefinite B, reducing the number of required samples by a factor n or even more, where n is the size of B. Even for an SPD matrix, our work improves an existing result by Roosta-Khorasani and Ascher (Found Comput Math, 15(5):1187–1212, 2015) for Rademacher vectors. This work also analyzes the combination of randomized trace estimates with the Lanczos method for approximating the trace of f(B). Particular attention is paid to the matrix logarithm, which is needed for log-determinant estimation. We improve and extend an existing result, to not only cover Rademacher but also Gaussian random vectors.

scholarly journals A gradient technique for an optimal control problem governed by a system of nonlinear first order partial differential equations

1995 ◽  
Vol 36 (3) ◽  
pp. 261-273 ◽  
Author(s):  
Mohammad A. Kazemi
Keyword(s):  
Optimal Control ◽  
Partial Differential Equations ◽  
Differential Equations ◽  
Optimal Control Problems ◽  
Fréchet Derivative ◽  
Necessary Condition ◽  
Control Problems ◽  
Partial Differential ◽  
Frechet Derivative ◽  
First Order

AbstractIn this paper a class of optimal control problems with distributed parameters is considered. The governing equations are nonlinear first order partial differential equations that arise in the study of heterogeneous reactors and control of chemical processes. The main focus of the present paper is the mathematical theory underlying the algorithm. A conditional gradient method is used to devise an algorithm for solving such optimal control problems. A formula for the Fréchet derivative of the objective function is obtained, and its properties are studied. A necessary condition for optimality in terms of the Fréchet derivative is presented, and then it is shown that any accumulation point of the sequence of admissible controls generated by the algorithm satisfies this necessary condition for optimality.

On the non-reducibility of the (u,v)-derivative to the Fréchet derivative

1982 ◽  
Vol 37 (1) ◽  
pp. 153-154
Author(s):  
I A Bakhtin ◽  
V I Sobolev ◽  
V M Shcherbin
Keyword(s):  
Fréchet Derivative ◽  
Frechet Derivative
Sign in / Sign up

Export Citation Format

Share Document