| 1. |
- Abella, Jaume, et al.
(författare)
-
SAFEXPLAIN : Safe and Explainable Critical Embedded Systems Based on AI
- 2023
-
Ingår i: DATE 23: Design, Automation And Test In Europe. - 9783981926378 ; , s. 1-6
-
Konferensbidrag (refereegranskat)abstract
- Deep Learning (DL) techniques are at the heart of most future advanced software functions in Critical Autonomous AI-based Systems (CAIS), where they also represent a major competitive factor. Hence, the economic success of CAIS industries (e.g., automotive, space, railway) depends on their ability to design, implement, qualify, and certify DL-based software products under bounded effort/cost. However, there is a fundamental gap between Functional Safety (FUSA) requirements on CAIS and the nature of DL solutions. This gap stems from the development process of DL libraries and affects high-level safety concepts such as (1) explainability and traceability, (2) suitability for varying safety requirements, (3) FUSA-compliant implementations, and (4) real-time constraints. As a matter of fact, the data-dependent and stochastic nature of DL algorithms clashes with current FUSA practice, which instead builds on deterministic, verifiable, and pass/fail test-based software. The SAFEXPLAIN project tackles these challenges and targets by providing a flexible approach to allow the certification - hence adoption - of DL-based solutions in CAIS building on: (1) DL solutions that provide end-to-end traceability, with specific approaches to explain whether predictions can be trusted and strategies to reach (and prove) correct operation, in accordance to certification standards; (2) alternative and increasingly sophisticated design safety patterns for DL with varying criticality and fault tolerance requirements; (3) DL library implementations that adhere to safety requirements; and (4) computing platform configurations, to regain determinism, and probabilistic timing analyses, to handle the remaining non-determinism. © 2023 EDAA.
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Barbarino, Giovanni, et al.
(författare)
-
Block generalized locally Toeplitz sequences : theory and applications in the multidimensional case
- 2020
-
Ingår i: Electronic Transactions on Numerical Analysis. - : Osterreichische Akademie der Wissenschaften. - 1068-9613. ; 53, s. 113-216
-
Tidskriftsartikel (refereegranskat)abstract
- In computational mathematics, when dealing with a large linear discrete problem (e.g., a linear system) arising from the numerical discretization of a partial differential equation (PDE), knowledge of the spectral distribution of the associated matrix has proved to be useful information for designing/analyzing appropriate solvers-especially, preconditioned Krylov and multigrid solvers-for the considered problem. Actually, this spectral information is of interest also in itself as long as the eigenvalues of the aforementioned matrix represent physical quantities of interest, which is the case for several problems from engineering and applied sciences (e.g., the study of natural vibration frequencies in an elastic material). The theory of multilevel generalized locally Toeplitz (GLT) sequences is a powerful apparatus for computing the asymptotic spectral distribution of matrices A(n) arising from virtually any kind of numerical discretization of PDEs. Indeed, when the mesh-fineness parameter n tends to infinity, these matrices A(n) give rise to a sequence {A(n)}(n), which often turns out to be a multilevel GLT sequence or one of its "relatives", i.e., a multilevel block GLT sequence or a (multilevel) reduced GLT sequence. In particular, multilevel block GLT sequences are encountered in the discretization of systems of PDEs as well as in the higher-order finite element or discontinuous Galerkin approximation of scalar/vectorial PDEs. In this work, we systematically develop the theory of multilevel block GLT sequences as an extension of the theories of (unilevel) GLT sequences [Garoni and Serra-Capizzano, Generalized Locally Toeplitz Sequences: Theory and Applications. Vol. I., Springer, Cham, 2017], multilevel GLT sequences [Garoni and Serra-Capizzano, Generalized Locally Toeplitz Sequences: Theory and Applications. Vol. II., Springer, Cham, 2018], and block GLT sequences [Barbarino, Garoni, and Serra-Capizzano, Electron. Trans. Numer. A(n)al., 53 (2020), pp. 28-112]. We also present several emblematic applications of this theory in the context of PDE discretizations.
|
|
| 5. |
- Barbarino, Giovanni, et al.
(författare)
-
Block generalized locally Toeplitz sequences : theory and applications in the unidimensional case
- 2020
-
Ingår i: Electronic Transactions on Numerical Analysis. - : Osterreichische Akademie der Wissenschaften. - 1068-9613. ; 53, s. 28-112
-
Tidskriftsartikel (refereegranskat)abstract
- In computational mathematics, when dealing with a large linear discrete problem (e.g., a linear system) arising from the numerical discretization of a differential equation (DE), knowledge of the spectral distribution of the associated matrix has proved to be useful information for designing/analyzing appropriate solvers-especially, preconditioned Krylov and multigrid solvers-for the considered problem. Actually, this spectral information is of interest also in itself as long as the eigenvalues of the aforementioned matrix represent physical quantities of interest, which is the case for several problems from engineering and applied sciences (e.g., the study of natural vibration frequencies in an elastic material). The theory of generalized locally Toeplitz (GLT) sequences is a powerful apparatus for computing the asymptotic spectral distribution of matrices A(n) arising from virtually any kind of numerical discretization of DEs. Indeed, when the mesh-fineness parameter n tends to infinity, these matrices A(n) give rise to a sequence {A(n)}(n), which often turns out to be a GLT sequence or one of its "relatives", i.e., a block GLT sequence or a reduced GLT sequence. In particular, block GLT sequences are encountered in the discretization of systems of DEs as well as in the higher-order finite element or discontinuous Galerkin approximation of scalar/vectorial DEs. This work is a review, refinement, extension, and systematic exposition of the theory of block GLT sequences. It also includes several emblematic applications of this theory in the context of DE discretizations.
|
|
| 6. |
- Barbarino, Giovanni, et al.
(författare)
-
Rectangular GLT sequences
- 2022
-
Ingår i: Electronic Transactions on Numerical Analysis. - : Osterreichische Akademie der Wissenschaften, Verlag. - 1068-9613. ; 55, s. 585-617
-
Tidskriftsartikel (refereegranskat)abstract
- The theory of generalized locally Toeplitz (GLT) sequences is a powerful apparatus for computingthe asymptotic spectral distribution of square matrices An arising from the discretization of differential problems.Indeed, as the mesh fineness parameter n increases to ∞, the sequence {An}n often turns out to be a GLT sequence.In this paper, motivated by recent applications, we further enhance the GLT apparatus by developing a full theory ofrectangular GLT sequences as an extension of the theory of classical square GLT sequences. We also provide twoexamples of application as an illustration of the potential of the theory presented herein
|
|
| 7. |
|
|
| 8. |
- Benedusi, Pietro, et al.
(författare)
-
Fast Parallel Solver for the Space-time IgA-DG Discretization of the Diffusion Equation
- 2021
-
Ingår i: Journal of Scientific Computing. - : Springer. - 0885-7474 .- 1573-7691. ; 89:1
-
Tidskriftsartikel (refereegranskat)abstract
- We consider the space-time discretization of the diffusion equation, using an isogeometric analysis (IgA) approximation in space and a discontinuous Galerkin (DG) approximation in time. Drawing inspiration from a former spectral analysis, we propose for the resulting space-time linear system a multigrid preconditioned GMRES method, which combines a preconditioned GMRES with a standard multigrid acting only in space. The performance of the proposed solver is illustrated through numerical experiments, which show its competitiveness in terms of iteration count, run-time and parallel scaling.
|
|
| 9. |
|
|
| 10. |
|
|
