Tensor Computation: A New Framework for High-Dimensional Problems in EDA

Many critical EDA problems suffer from the curse of dimensionality, i.e. the very fast-scaling computational burden produced by large number of parameters and/or unknown variables. This phenomenon may be caused by multiple spatial or temporal factors (e.g. 3-D field solvers discretizations and multi-rate circuit simulation), nonlinearity of devices and circuits, large number of design or optimization parameters (e.g. full-chip routing/placement and circuit sizing), or extensive process variations (e.g. variability/reliability analysis and design for manufacturability). The computational challenges generated by such high dimensional problems are generally hard to handle efficiently with traditional EDA core algorithms that are based on matrix and vector computation. This paper presents "tensor computation" as an alternative general framework for the development of efficient EDA algorithms and tools. A tensor is a high-dimensional generalization of a matrix and a vector, and is a natural choice for both storing and solving efficiently high-dimensional EDA problems. This paper gives a basic tutorial on tensors, demonstrates some recent examples of EDA applications (e.g., nonlinear circuit modeling and high-dimensional uncertainty quantification), and suggests further open EDA problems where the use of tensor computation could be of advantage.Comment: 14 figures. Accepted by IEEE Trans. CAD of Integrated Circuits and System

Numerical Methods for Integral Equations

We first propose a multiscale Galerkin method for solving the Volterra integral equations of the second kind with a weakly singular kernel. Due to the special structure of Volterra integral equations and the ``shrinking support property of multiscale basis functions, a large number of entries of the coefficient matrix appearing in the resulting discrete linear system are zeros. This result, combined with a truncation scheme of the coefficient matrix, leads to a fast numerical solution of the integral equation. A quadrature method is designed especially for the weakly singular kernel involved inside the integral operator to compute the nonzero entries of the compressed matrix so that the quadrature errors will not ruin the overall convergence order of the approximate solution of the integral equation. We estimate the computational cost of this numerical method and its approximate accuracy. Numerical experiments are presented to demonstrate the performance of the proposed method. We also exploit two methods based on neural network models and the collocation method in solving the linear Fredholm integral equations of the second kind. For the first neural network (NN) model, we cast the problem of solving an integral equation as a data fitting problem on a finite set, which gives rise to an optimization problem. In the second method, which is referred to as the NN-Collocation model, we first choose the polynomial space as the projection space of the Collocation method, then approximate the solution of the integral equation by a linear combination of polynomials in that space. The coefficients of the linear combination are served as the weights between the hidden layer and the output layer of the neural network. We train both neural network models using gradient descent with Adam optimizer. Finally, we compare the performances of the two methods and find that the NN-Collocation model offers a more stable, accurate, and efficient solution

Shifted Jacobi spectral collocation method with convergence analysis for solving integro-differential equations and system of integro-differential equations

This article addresses the solution of multi-dimensional integro-differential equations (IDEs) by means of the spectral collocation method and taking the advantage of the properties of shifted Jacobi polynomials. The applicability and accuracy of the present technique have been examined by the given numerical examples in this paper. By means of these numerical examples, we ensure that the present technique is simple and very accurate. Furthermore, an error analysis is performed to verify the correctness and feasibility of the proposed method when solving IDE

Hägusad teist liiki integraalvõrrandid

Käesolevas doktoritöös on uuritud hägusaid teist liiki integraalvõrrandeid. Need võrrandid sisaldavad hägusaid funktsioone, s.t. funktsioone, mille väärtused on hägusad arvud. Me tõestasime tulemuse sileda tuumaga hägusate Volterra integraalvõrrandite lahendite sileduse kohta. Kui integraalvõrrandi tuum muudab märki, siis integraalvõrrandi lahend pole üldiselt sile. Nende võrrandite lahendamiseks me vaatlesime kollokatsioonimeetodit tükiti lineaarsete ja tükiti konstantsete funktsioonide ruumis. Kasutades lahendi sileduse tulemusi tõestasime meetodite koonduvuskiiruse. Me vaatlesime ka nõrgalt singulaarse tuumaga hägusaid Volterra integraalvõrrandeid. Uurisime lahendi olemasolu, ühesust, siledust ja hägusust. Ülesande ligikaudseks lahendamiseks kasutasime kollokatsioonimeetodit tükiti polünoomide ruumis. Tõestasime meetodite koonduvuskiiruse ning uurisime lähislahendi hägusust. Nii analüüs kui ka numbrilised eksperimendid näitavad, et gradueeritud võrke kasutades saame parema koonduvuskiiruse kui ühtlase võrgu korral. Teist liiki hägusate Fredholmi integraalvõrrandite lahendamiseks pakkusime uue lahendusmeetodi, mis põhineb kõigi võrrandis esinevate funktsioonide lähendamisel Tšebõšovi polünoomidega. Uurisime nii täpse kui ka ligikaudse lahendi olemasolu ja ühesust. Tõestasime meetodi koonduvuse ja lähislahendi hägususe.In this thesis we investigated fuzzy integral equations of the second kind. These equations contain fuzzy functions, i.e. functions whose values are fuzzy numbers. We proved a regularity result for solution of fuzzy Volterra integral equations with smooth kernels. If the kernel changes sign, then the solution is not smooth in general. We proposed collocation method with triangular and rectangular basis functions for solving these equations. Using the regularity result we estimated the order of convergence of these methods. We also investigated fuzzy Volterra integral equations with weakly singular kernels. The existence, regularity and the fuzziness of the exact solution is studied. Collocation methods on discontinuous piecewise polynomial spaces are proposed. A convergence analysis is given. The fuzziness of the approximate solution is investigated. Both the analysis and numerical methods show that graded mesh is better than uniform mesh for these problems. We proposed a new numerical method for solving fuzzy Fredholm integral equations of the second kind. This method is based on approximation of all functions involved by Chebyshev polynomials. We analyzed the existence and uniqueness of both exact and approximate fuzzy solutions. We proved the convergence and fuzziness of the approximate solution.https://www.ester.ee/record=b539569

Superconvergent Nyström and Degenerate Kernel Methods for Integro-Differential Equations

This research received no external funding and APC was funded by University of Granada.The aim of this paper is to carry out an improved analysis of the convergence of the Nystrom and degenerate kernel methods and their superconvergent versions for the numerical solution of a class of linear Fredholm integro-differential equations of the second kind. By using an interpolatory projection at Gauss points onto the space of (discontinuous) piecewise polynomial functions of degree <= r - 1, we obtain convergence order 2r for degenerate kernel and Nystrom methods, while, for the superconvergent and the iterated versions of theses methods, the obtained convergence orders are 3r + 1 and 4r, respectively. Moreover, we show that the optimal convergence order 4r is restored at the partition knots for the approximate solutions. The obtained theoretical results are illustrated by some numerical examples.University of Granad

A Personal Perspective on the History of the Numerical Analysis of Fredholm Integral Equations of the Second Kind

This is a personal perspective on the development of numerical methods for solving Fredholm integral equations of the second kind, discussing work being done principally during the 1950s and 1960s. The principal types of numerical methods being studied were projection methods (Galerkin, collocation) and Nyström methods. During the 1950s and 1960s, functional analysis became the framework for the analysis of numerical methods for solving integral equations, and this in‡uenced the questions being asked. This paper looks at the history of the analyses being done at that time.

Jacobi pseudo-spectral Galerkin method for second kind Volterra integro-differential equations with a weakly singular kernel

The Jacobi pseudo-spectral Galerkin method for the Volterra integro-differential equations of the second kind with a weakly singular kernel is proposed in this paper. We provide a rigorous error analysis for the proposed method, which indicates that the numerical errors (in the Lωα,β2-norm and the L∞-norm) will decay exponentially provided that the source function is sufficiently smooth. Numerical examples are given to illustrate the theoretical results