1,720,972 research outputs found
An improved subspace selection algorithm for meshless collocation methods
No full textChoosing data points is a common problem for researchers who employ various meshless methods for solving partial differential equations. On the one hand, high accuracy is always desired: oil the other, ill-conditioning problems of the resultant matrices, which may lead to unstable algorithms, prevent some researchers from using meshless methods. For example, the optimal placements of source points in the method of fundamental solutions or of the centers in the radial basis functions method are always unclear. Intuitively, Such optimal locations will depend on many factors: the partial differential equations, the domain, the trial basis used (i.e. the employed method itself), the computational precisions, some user-defined parameters, and so on. Such complexity makes the hope of having an optimal centers placement unpromising. In this paper, we provide a data-dependent algorithm that adaptively selects centers based on all the other variables. Copyright (C) 2009 John Wiley & Sons, Ltd
Stable and Convergent Unsymmetric Meshless Collocation Methods
No full textIn the theoretical part of this paper, we introduce a simplified proof technique for error bounds and convergence of a variation of Kansa's well-known unsymmetric meshless collocation method. For a numerical implementation of the convergent variation, a previously proposed greedy technique is coupled with linear optimization. This algorithm allows a fully adaptive on-the-fly data dependent meshless selection of test and trial spaces. The new method satisfies the assumptions of the background theory, and numerical experiments demonstrate its stability
On convergent numerical algorithms for unsymmetric collocation
No full textIn this paper, we are interested in some convergent formulations for the unsymmetric collocation method or the so-called Kansa's method. We review some newly developed theories on solvability and convergence. The rates of convergence of these variations of Kansa's method are examined and verified in arbitrary-precision computations. Numerical examples confirm with the theories that the modified Kansa's method converges faster than the interpolant to the solution; that is, exponential convergence for the multiquadric and Gaussian radial basis functions (RBFs). Some numerical algorithms are proposed for efficiency and accuracy in practical applications of Kansa's method. In double-precision, even for very large RBF shape parameters, we show that the modified Kansa's method, through a subspace selection using a greedy algorithm, can produce acceptable approximate solutions. A benchmark algorithm is used to verify the optimality of the selection process
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe 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
Full text link“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
Full text linkWe 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
A univariate quasi-multiquadric interpolationwith better smoothness
No full textAbstractIn this paper, we propose a multilevel univariate quasi-interpolation scheme usingmultiquadric basis. It is practical as it does not require derivative values of the function being interpolated. It has a higher degree of smoothness than the original level-0 formula as it allows a shape parameter c=O(h). Our level-1 quasi-interpolation costs O(nlogn) flops to set up. It preserves strict convexity and monotonicity. When c=O(h), we prove the proposed scheme converges with a rate of O(h2.5logh).Furthermore, if both |ƒ″(a)| and |ƒ″| are relatively small compared with ‖ƒ″‖∞, the convergence rate will increase. We verify numerically that c = h is a good shape parameter to use for our method, hence we need not find the optimal parameter. For all test functions, both convergence speed and error are optimized for c between 0.5h and 1.5h. Our method can be generalized to a multilevel scheme; we include the numerical results for the level-2 scheme. The shape parameter of the level-2 scheme can be chosen between 2h to 3h
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe 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
- …
