1,720,956 research outputs found
Model Reduction in space and time for ab initio decomposition of 4D Variational Data Assimilation problems
We present an innovative approach for solving time dependent Four Dimensional Variational Data Assimilation (4D VAR DA) problems. The proposed approach performs a decomposition of the whole physical domain, i.e. both along spatial and temporal directions; a reduction in space and time of both the Partial Differential Equations-based model and the Data Assimilation functional; finally it uses a modified regularization functional describing restricted 4D VAR DA problems on the domain decomposition. Innovation mainly lies in the introduction ab initio, i.e. on the numerical model – of a domain decomposition approach in space and time joining the idea of Schwarz's method and Parallel in Time (PinT)–based approaches. We provide the numerical framework of this method including convergence analysis and error propagation. A validation analysis is performed discussing computational results on a case study relying on Shallow Water Equations. © 2020 IMAC
A note on domain decomposition approaches for solving 3D variational data assimilation models
Data assimilation (DA) is a methodology for combining mathematical models simulating complex systems (the background knowledge) and measurements (the reality or observational data) in order to improve the estimate of the system state (the forecast). The DA is an inverse and ill posed problem usually used to handle a huge amount of data, so, it is a big and computationally expensive problem. In the present work we prove that the functional decomposition of the 3D variational data assimilation (3D Var DA) operator, previously introduced by the authors, is equivalent to apply multiplicative parallel Schwarz (MPS) method, to the Euler–Lagrange equations arising from the minimization of the data assimilation functional. It results that convergence issues as well as mesh refininement techniques and coarse grid correction—issues of the functional decomposition not previously addressed—could be employed to improve performance and scalability of the 3D Var DA functional decomposition in real cases
A scalable Kalman Filter algorihm: trustworthy analysis on constrained least square model
Kalman filter (KF) is one of the most important and common estimation algorithms. We introduce an innovative designing of Kalman filter algorithm based on domain decomposition (we call it DD‐KF). DD‐KF involves decomposition of the whole computational problem, partitioning of the solution and a slight modification of KF algorithm allowing a correction at run‐time of local solutions. The resulted parallel algorithm consists of concurrent copies of KF algorithm, each one requiring the same amount of computations on each subdomain and an exchange of boundary conditions between adjacent subdomains. Main advantage of this approach is that it can be potentially applied in a moderately nonintrusive manner to existing codes for tracking and controlling systems in location, navigation, in computer graphics and in much more state estimation problems. To highlight the capability of DD‐KF of exploiting the computing power provided by future designs of microprocessors based on multi/many‐cores CPU/GPU technologies, we consider DD both at physical core level and at microprocessor level and we discuss scalability of DD‐KF algorithm at coarse and fine grained level. Throughout the present work, we derive and discuss DD‐KF algorithm for solving constrained least square model, which underlies any data sampling and estimation problem
Ab inizio Functional Decomposition of Kalman Filter: a Feasibility Analysis on Constrained Least Squares Problems
The standard formulation of Kalman Filter (KF) becomes computationally intractable for solving large scale state space estimation problems as in ocean/weather forecasting due to matrix storage and inversion requirements. We introduce an innovative mathematical/numerical formulation of KF using Domain Decomposition (DD) approach. The proposed DD approach partitions ab-initio the whole KF computational method giving rise to local KF methods that can be solved independently. We present its feasibility analysis using the constrained least square model underlying variational Data Dssimilation problems. Results confirm that the accuracy of solutions of local KF methods are not impaired by DD approach
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
We provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
We conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
