Suchergebnisse - Geometrical problems and computations General Terms Algorithms

An improved formalism for quantum computation based on geometric algebra—case study: Grover’s search algorithm von Chappell, James M., Iqbal, Azhar, Lohe, M. A., von Smekal, Lorenz, Abbott, Derek

“… Using this formalism we efficiently solve the exact search problem, as well as easily representing more general search situations …”
Volltext

Graph theoretic methods in multiagent networks von Mesbahi, Mehran, Egerstedt, Magnus

“… This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of …”
Volltext

On 3-stage geometric explicit Runge–Kutta method for singular autonomous initial value problems in ordinary differential equations von Akanbi, Moses Adebowale

“… ’ series incremental function. In this work, a 3-stage geometric explicit Runge–Kutta method for solving autonomous initial value problems in ordinary differential equations is derived and implemented …”
Volltext

Topological Derivatives of Shape Functionals. Part I: Theory in Singularly Perturbed Geometrical Domains von Novotny, Antonio André, Sokołowski, Jan, Żochowski, Antoni

“… Mathematical analysis and numerical solutions of problems with unknown shapes or geometrical domains is a challenging and rich research field in the modern theory of the calculus of variations …”
Volltext

A Variational Framework for Curve Shortening in Various Geometric Domains von Yuan, Na, Wang, Peihui, Meng, Wenlong, Chen, Shuangmin, Xu, Jian, Xin, Shiqing, He, Ying, Wang, Wenping

“… Geodesics measure the shortest distance (either locally or globally) between two points on a curved surface and serve as a fundamental tool in digital geometry …”
Volltext

Presentation of the Book The Gröbner Cover von Montes, Antonio

“… It also includes applications to the automatic deduction of geometric theorems, loci computation and envelopes …”
Volltext

Convergence rates and asymptotic standard errors for Markov chain Monte Carlo algorithms for Bayesian probit regression von Roy, Vivekananda, Hobert, James P

“… We prove that Albert and Chib's data augmentation algorithm and Liu and Wu's PX-DA algorithm both converge at a geometric rate, which ensures the existence of central limit theorems for ergodic …”
Volltext

Point Cloud Denoising via Feature Graph Laplacian Regularization von Dinesh, Chinthaka, Cheung, Gene, Bajic, Ivan V.

“… Using SDFGLR as a signal prior, we formulate an optimization problem with a general ℓ …”
Volltext

Computational aspects of the geometric mean of two matrices: a survey von Bini, Dario A., Iannazzo, Bruno

“… Algorithms for the computation of the (weighted) geometric mean G of two positive definite matrices are described and discussed …”
Volltext

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes von Chandran, L. Sunil, Francis, Mathew C., Sivadasan, Naveen

“… A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs …”
Volltext

Network Design under General Wireless Interference von Halldórsson, Magnús M., Kortsarz, Guy, Mitra, Pradipta, Tonoyan, Tigran

“… We introduce the problem of finding a spanning tree along with a partition of the tree edges into the fewest number of feasible sets, where constraints on the edges define feasibility …”
Volltext

Topological Derivatives of Shape Functionals. Part III: Second-Order Method and Applications von Novotny, Antonio André, Sokołowski, Jan, Żochowski, Antoni

“… The framework of asymptotic analysis in singularly perturbed geometrical domains presented in the first part of this series of review papers can be employed to produce two-term asymptotic expansions …”
Volltext

A 1d Up Approach to Conformal Geometric Algebra: Applications in Line Fitting and Quantum Mechanics von Lasenby, Anthony N.

“… under both rotations and translations, unlike the cost functions which have been used in CGA so far. An algorithm is given for application of this method to the problem of matching …”
Volltext

Non-stoquastic Hamiltonians in quantum annealing via geometric phases von Vinci, Walter, Lidar, Daniel A.

“… We argue that a complete description of quantum annealing implemented with continuous variables must take into account the non-adiabatic Aharonov-Anandan geometric phase that arises when the system …”
Volltext

Structural topology optimization with implicit design variable—optimality and algorithm von Tong, Liyong, Lin, Jiangzi

“… Based on the Karush–Kuhn–Tucker (KKT) necessary conditions, optimality criteria for finding solutions are established and then employed to develop a simple algorithm for one-material minimum mean compliance and compliant mechanism problems …”
Volltext

Three-points interfacial quadrature for geometrical source terms on nonuniform grids: Application to finite volume schemes for parameter-dependent differential equations von Katsaounis, Theodoros, Simeoni, Chiara

“… ) regularity for nonuniform meshes is introduced in the most general case, to compensate possibly reduced consistency conditions, and the optimality of the convergence rates with respect …”
Volltext

On geometric multigrid methods for triangular grids using three-coarsening strategy von Gaspar, F.J., Gracia, J.L., Lisbona, F.J., Rodrigo, C.

“… This paper deals with the design of efficient geometric multigrid methods on hierarchical triangular grids using a three-coarsening strategy. In [F.J. Gaspar, J.L. Gracia, F.J …”
Volltext

Topological Derivatives of Shape Functionals. Part II: First-Order Method and Applications von Novotny, Antonio André, Sokołowski, Jan, Żochowski, Antoni

“… The framework of topological sensitivity analysis in singularly perturbed geometrical domains, presented in the first part of this series of review papers, allows the asymptotic expansion of a given …”
Volltext

High-Dimensional Approximate r-Nets von Avarikioti, Z., Emiris, I. Z., Kavouras, L., Psarros, I.

“… We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate r -nets with respect to Euclidean distance. For any fixed ϵ …”
Volltext

A Fast Butterfly Algorithm for the Computation of Fourier Integral Operators von Candès, Emmanuel, Demanet, Laurent, Ying, Lexing

“… This paper is concerned with the fast computation of Fourier integral operators of the general form $\int_{\mathbb{R}^d}e^{2\pi\imath\Phi(x,k)}f(k)dk$, where $k …”
Volltext