Guaranteed convergence for a class of coupled-cluster methods based on Arponen's extended theory

• URL: http://arxiv.org/abs/2003.06796v1
• Date: Sun, 15 Mar 2020 11:24:30 GMT
• Title: Guaranteed convergence for a class of coupled-cluster methods based on Arponen's extended theory
• Authors: Simen Kvaal, Andre Laestadius, Tilmann Bodenstein
• Abstract summary: This class of methods is formulated in terms of a coordinate transformation of the cluster operators. The concept of local strong monotonicity of the flipped gradient of the energy is central. Some numerical experiments are presented, and the use of canonical coordinates for diagnostics is discussed.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A wide class of coupled-cluster methods is introduced, based on Arponen's extended coupled-cluster theory. This class of methods is formulated in terms of a coordinate transformation of the cluster operators. The mathematical framework for the error analysis of coupled-cluster methods based on Arponen's bivariational principle is presented, in which the concept of local strong monotonicity of the flipped gradient of the energy is central. A general mathematical result is presented, describing sufficient conditions for coordinate transformations to preserve the local strong monotonicity. The result is applied to the presented class of methods, which include the standard and quadratic coupled-cluster methods, and also Arponen's canonical version of extended coupled-cluster theory. Some numerical experiments are presented, and the use of canonical coordinates for diagnostics is discussed.

Related papers

• The time-dependent bivariational principle: Theoretical foundation for real-time propagation methods of coupled-cluster type [0.0]
  The time-dependent bivariational principle (TD-BIVP) is known to be the proper framework for coupled-cluster type methods. Conservation laws and Poisson brackets are introduced, completing the analogy with classical mechanics.
  arXiv  Detail & Related papers  (2024-10-31T17:51:44Z)
• Algebraic method of group classification for semi-normalized classes of differential equations [0.0]
  We prove the important theorems on factoring out symmetry groups and invariance algebras of systems from semi-normalized classes. Nontrivial examples of classes that arise in real-world applications are provided.
  arXiv  Detail & Related papers  (2024-08-29T20:42:04Z)
• HeNCler: Node Clustering in Heterophilous Graphs through Learned Asymmetric Similarity [55.27586970082595]
  HeNCler is a novel approach for Heterophilous Node Clustering. We show that HeNCler significantly enhances performance in node clustering tasks within heterophilous graph contexts.
  arXiv  Detail & Related papers  (2024-05-27T11:04:05Z)
• Coupled-Cluster Theory Revisited. Part II: Analysis of the single-reference Coupled-Cluster equations [0.0]
  We analyze the nonlinear equations of the single-reference Coupled-Cluster method using topological degree theory. For the truncated Coupled-Cluster method, we derive an energy error bound for approximate eigenstates of the Schrodinger equation.
  arXiv  Detail & Related papers  (2023-03-27T11:21:19Z)
• Gradient Based Clustering [72.15857783681658]
  We propose a general approach for distance based clustering, using the gradient of the cost function that measures clustering quality. The approach is an iterative two step procedure (alternating between cluster assignment and cluster center updates) and is applicable to a wide range of functions.
  arXiv  Detail & Related papers  (2022-02-01T19:31:15Z)
• Coupled-Cluster Theory Revisited. Part I: Discretization [0.0]
  We describe the discretization schemes involved in Coupled-Cluster methods using graph-based concepts. We derive the single-reference and the Jeziorski-Monkhorst multireference Coupled-Cluster equations in a unified and rigorous manner.
  arXiv  Detail & Related papers  (2021-05-19T16:35:49Z)
• Spatially Coherent Clustering Based on Orthogonal Nonnegative Matrix Factorization [0.0]
  We introduce in this work clustering models based on a total variation (TV) regularization procedure on the cluster membership matrix. We provide a numerical evaluation of all proposed methods on a hyperspectral dataset obtained from a matrix-assisted laser desorption/ionisation imaging measurement.
  arXiv  Detail & Related papers  (2021-04-25T23:40:41Z)
• Clustering Ensemble Meets Low-rank Tensor Approximation [50.21581880045667]
  This paper explores the problem of clustering ensemble, which aims to combine multiple base clusterings to produce better performance than that of the individual one. We propose a novel low-rank tensor approximation-based method to solve the problem from a global perspective. Experimental results over 7 benchmark data sets show that the proposed model achieves a breakthrough in clustering performance, compared with 12 state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-12-16T13:01:37Z)
• Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
  Existing scalable hierarchical clustering methods sacrifice quality for speed. We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
  arXiv  Detail & Related papers  (2020-10-22T15:58:35Z)
• A Novel Granular-Based Bi-Clustering Method of Deep Mining the Co-Expressed Genes [76.84066556597342]
  Bi-clustering methods are used to mine bi-clusters whose subsets of samples (genes) are co-regulated under their test conditions. Unfortunately, traditional bi-clustering methods are not fully effective in discovering such bi-clusters. We propose a novel bi-clustering method by involving here the theory of Granular Computing.
  arXiv  Detail & Related papers  (2020-05-12T02:04:40Z)
• Clustering Binary Data by Application of Combinatorial Optimization Heuristics [52.77024349608834]
  We study clustering methods for binary data, first defining aggregation criteria that measure the compactness of clusters. Five new and original methods are introduced, using neighborhoods and population behavior optimization metaheuristics. From a set of 16 data tables generated by a quasi-Monte Carlo experiment, a comparison is performed for one of the aggregations using L1 dissimilarity, with hierarchical clustering, and a version of k-means: partitioning around medoids or PAM.
  arXiv  Detail & Related papers  (2020-01-06T23:33:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.