9,199 research outputs found

    Passivity-preserving parameterized model order reduction using singular values and matrix interpolation

    Get PDF
    We present a parameterized model order reduction method based on singular values and matrix interpolation. First, a fast technique using grammians is utilized to estimate the reduced order, and then common projection matrices are used to build parameterized reduced order models (ROMs). The design space is divided into cells, and a Krylov subspace is computed for each cell vertex model. The truncation of the singular values of the merged Krylov subspaces from the models located at the vertices of each cell yields a common projection matrix per design space cell. Finally, the reduced system matrices are interpolated using positive interpolation schemes to obtain a guaranteed passive parameterized ROM. Pertinent numerical results validate the proposed technique

    Guaranteed passive parameterized model order reduction of the partial element equivalent circuit (PEEC) method

    Get PDF
    The decrease of IC feature size and the increase of operating frequencies require 3-D electromagnetic methods, such as the partial element equivalent circuit (PEEC) method, for the analysis and design of high-speed circuits. Very large systems of equations are often produced by 3-D electromagnetic methods. During the circuit synthesis of large-scale digital or analog applications, it is important to predict the response of the system under study as a function of design parameters, such as geometrical and substrate features, in addition to frequency (or time). Parameterized model order reduction (PMOR) methods become necessary to reduce large systems of equations with respect to frequency and other design parameters. We propose an innovative PMOR technique applicable to PEEC analysis, which combines traditional passivity-preserving model order reduction methods and positive interpolation schemes. It is able to provide parametric reduced-order models, stable, and passive by construction over a user-defined range of design parameter values. Numerical examples validate the proposed approach

    Recent advances in directional statistics

    Get PDF
    Mainstream statistical methodology is generally applicable to data observed in Euclidean space. There are, however, numerous contexts of considerable scientific interest in which the natural supports for the data under consideration are Riemannian manifolds like the unit circle, torus, sphere and their extensions. Typically, such data can be represented using one or more directions, and directional statistics is the branch of statistics that deals with their analysis. In this paper we provide a review of the many recent developments in the field since the publication of Mardia and Jupp (1999), still the most comprehensive text on directional statistics. Many of those developments have been stimulated by interesting applications in fields as diverse as astronomy, medicine, genetics, neurology, aeronautics, acoustics, image analysis, text mining, environmetrics, and machine learning. We begin by considering developments for the exploratory analysis of directional data before progressing to distributional models, general approaches to inference, hypothesis testing, regression, nonparametric curve estimation, methods for dimension reduction, classification and clustering, and the modelling of time series, spatial and spatio-temporal data. An overview of currently available software for analysing directional data is also provided, and potential future developments discussed.Comment: 61 page

    Detecting gravitational waves from precessing binaries of spinning compact objects: Adiabatic limit

    Get PDF
    Black-hole (BH) binaries with single-BH masses m=5--20 Msun, moving on quasicircular orbits, are among the most promising sources for first-generation ground-based gravitational-wave (GW) detectors. Until now, the development of data-analysis techniques to detect GWs from these sources has been focused mostly on nonspinning BHs. The data-analysis problem for the spinning case is complicated by the necessity to model the precession-induced modulations of the GW signal, and by the large number of parameters needed to characterize the system, including the initial directions of the spins, and the position and orientation of the binary with respect to the GW detector. In this paper we consider binaries of maximally spinning BHs, and we work in the adiabatic-inspiral regime to build families of modulated detection templates that (i) are functions of very few physical and phenomenological parameters, (ii) model remarkably well the dynamical and precessional effects on the GW signal, with fitting factors on average >~ 0.97, but (iii) might require increasing the detection thresholds, offsetting at least partially the gains in the fitting factors. Our detection-template families are quite promising also for the case of neutron-star--black-hole binaries, with fitting factors on average ~ 0.93. For these binaries we also suggest (but do not test) a further template family, which would produce essentially exact waveforms written directly in terms of the physical spin parameters.Comment: 38 pages, 16 figures, RevTeX4. Final PRD version. Lingering typos corrected. Small corrections to GW flux terms as per Blanchet et al., PRD 71, 129902(E)-129904(E) (2005

    UWB Antennas: Design and Modeling

    Get PDF

    On-Manifold Recursive Bayesian Estimation for Directional Domains

    Get PDF

    Physics-based passivity-preserving parameterized model order reduction for PEEC circuit analysis

    Get PDF
    The decrease of integrated circuit feature size and the increase of operating frequencies require 3-D electromagnetic methods, such as the partial element equivalent circuit (PEEC) method, for the analysis and design of high-speed circuits. Very large systems of equations are often produced by 3-D electromagnetic methods, and model order reduction (MOR) methods have proven to be very effective in combating such high complexity. During the circuit synthesis of large-scale digital or analog applications, it is important to predict the response of the circuit under study as a function of design parameters such as geometrical and substrate features. Traditional MOR techniques perform order reduction only with respect to frequency, and therefore the computation of a new electromagnetic model and the corresponding reduced model are needed each time a design parameter is modified, reducing the CPU efficiency. Parameterized model order reduction (PMOR) methods become necessary to reduce large systems of equations with respect to frequency and other design parameters of the circuit, such as geometrical layout or substrate characteristics. We propose a novel PMOR technique applicable to PEEC analysis which is based on a parameterization process of matrices generated by the PEEC method and the projection subspace generated by a passivity-preserving MOR method. The proposed PMOR technique guarantees overall stability and passivity of parameterized reduced order models over a user-defined range of design parameter values. Pertinent numerical examples validate the proposed PMOR approach

    Counterfactual Sensitivity and Robustness

    Full text link
    Researchers frequently make parametric assumptions about the distribution of unobservables when formulating structural models. Such assumptions are typically motived by computational convenience rather than economic theory and are often untestable. Counterfactuals can be particularly sensitive to such assumptions, threatening the credibility of structural modeling exercises. To address this issue, we leverage insights from the literature on ambiguity and model uncertainty to propose a tractable econometric framework for characterizing the sensitivity of counterfactuals with respect to a researcher's assumptions about the distribution of unobservables in a class of structural models. In particular, we show how to construct the smallest and largest values of the counterfactual as the distribution of unobservables spans nonparametric neighborhoods of the researcher's assumed specification while other `structural' features of the model, e.g. equilibrium conditions, are maintained. Our methods are computationally simple to implement, with the nuisance distribution effectively profiled out via a low-dimensional convex program. Our procedure delivers sharp bounds for the identified set of counterfactuals (i.e. without parametric assumptions about the distribution of unobservables) as the neighborhoods become large. Over small neighborhoods, we relate our procedure to a measure of local sensitivity which is further characterized using an influence function representation. We provide a suitable sampling theory for plug-in estimators and apply our procedure to models of strategic interaction and dynamic discrete choice

    Truncated Moment Problem for Dirac Mixture Densities with Entropy Regularization

    Full text link
    We assume that a finite set of moments of a random vector is given. Its underlying density is unknown. An algorithm is proposed for efficiently calculating Dirac mixture densities maintaining these moments while providing a homogeneous coverage of the state space.Comment: 18 pages, 6 figure
    corecore