检索结果-内蒙古大学图书馆

Quantum Circuits for the Heat Equation with Physical Boundary Conditions Via Schrödingerisation

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Jin, Shi Liu, Nana Yu, Yue School of Mathematical Sciences Institute of Natural Sciences MOE-LSC Shanghai Jiao Tong University Shanghai200240 China University of Michigan Shanghai Jiao Tong University Joint Institute Shanghai200240 China School of Mathematics and Computational Science Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education National Center for Applied Mathematics in Hunan Xiangtan University Hunan Xiangtan411105 China

This paper explores the explicit design of quantum circuits for quantum simulation of partial differential equations (PDEs) with physical boundary conditions. These equations and/or their discretized forms usually do not evolve via unitary dynamics, thus are not suitable for quantum simulation. Boundary conditions (either time-dependent or independent) make the problem more difficult. To tackle this challenge, the Schrödingerisation method can be employed, which converts linear partial and ordinary differential equations with non-unitary dynamics into systems of Schrödinger-type equations, via the so-called warped phase transformation that maps the equation into one higher dimension. Despite advancements in Schrödingerisation techniques, the explicit implementation of quantum circuits for solving general PDEs, especially with physical boundary conditions, remains underdeveloped. We present two methods for handling the inhomogeneous terms arising from time-dependent physical boundary conditions. One approach utilizes Duhamel's principle to express the solution in integral form and employs linear combination of unitaries (LCU) for coherent state preparation. Another method applies an augmentation to transform the inhomogeneous problem into a homogeneous one. We then apply the quantum simulation technique from [CJL23] to transform the resulting non-autonomous system to an autonomous system in one higher dimension. We provide detailed implementations of these two methods and conduct a comprehensive complexity analysis in terms of queries to the time evolution input oracle. © 2024, The Authors. All rights reserved.

关键词： Boundary conditions

Quantum Circuits for the heat equation with physical boundary conditions via Schrödingerisation

学校读者我要写书评

暂无评论

arXiv 2024年

This paper explores the explicit design of quantum circuits for quantum simulation of partial differential equations (PDEs) with physical boundary conditions. These equations and/or their discretized forms usually do not evolve via unitary dynamics, thus are not suitable for quantum simulation. Boundary conditions (either time-dependent or independent) make the problem more difficult. To tackle this challenge, the Schrödingerisation method can be employed, which converts linear partial and ordinary differential equations with non-unitary dynamics into systems of Schrödinger-type equations, via the so-called warped phase transformation that maps the equation into one higher dimension. Despite advancements in Schrödingerisation techniques, the explicit implementation of quantum circuits for solving general PDEs, especially with physical boundary conditions, remains underdeveloped. We present two methods for handling the inhomogeneous terms arising from time-dependent physical boundary conditions. One approach utilizes Duhamel’s principle to express the solution in integral form and employs linear combination of unitaries (LCU) for coherent state preparation. Another method applies an augmentation to transform the inhomogeneous problem into a homogeneous one. We then apply the quantum simulation technique from [CJL23] to transform the resulting non-autonomous system to an autonomous system in one higher dimension. We provide detailed implementations of these two methods and conduct a comprehensive complexity analysis in terms of queries to the time evolution input oracle. © 2024, CC BY-NC-ND.

关键词： Ordinary differential equations

A unifying framework for n-dimensional quasi-conformal mappings

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhang, Daoping Choi, Gary P.T. Zhang, Jianping Lui, Lok Ming School of Mathematical Sciences Nankai University Tianjin300071 China Department of Mathematics Massachusetts Institute of Technology CambridgeMA02139 United States School of Mathematics and Computational Science Hunan National Center for Applied Mathematics Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Hunan Xiangtan411105 China Department of Mathematics The Chinese University of Hong Kong Hong Kong

With the advancement of computer technology, there is a surge of interest in effective mapping methods for objects in higher-dimensional spaces. To establish a one-to-one correspondence between objects, higher-dimensional quasi-conformal theory can be utilized for ensuring the bijectivity of the mappings. In addition, it is often desirable for the mappings to satisfy certain prescribed geometric constraints and possess low distortion in conformality or volume. In this work, we develop a unifying framework for computing n-dimensional quasi-conformal mappings. More specifically, we propose a variational model that integrates quasi-conformal distortion, volumetric distortion, landmark correspondence, intensity mismatch and volume prior information to handle a large variety of deformation problems. We further prove the existence of a minimizer for the proposed model and devise efficient numerical methods to solve the optimization problem. We demonstrate the effectiveness of the proposed framework using various experiments in two- and three-dimensions, with applications to medical image registration, adaptive remeshing and shape modeling. Copyright © 2021. The Authors. All rights reserved.

关键词： Numerical methods

Whole genome/proteome based phylogeny reconstruction for prokaryotes using higher order Markov model and chaos game representation

学校读者我要写书评

暂无评论

Molecular phylogenetics and evolution 2016年 96卷 102-111页

作者： Wei-Feng Yang Zu-Guo Yu Vo Anh Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan 411105 PR China Department of Mathematics and Physics Hunan Institute of Engineering Hunan 411104 PR China. Electronic address: yangweifeng09@***. School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane QLD 4001 Australia. Electronic address: yuzuguo@***. School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane QLD 4001 Australia. Electronic address: v.anh@qut.edu.au.

UNLABELLED:Traditional methods for sequence comparison and phylogeny reconstruction rely on pair wise and multiple sequence alignments. But alignment could not be directly applied to whole genome/proteome comparison and phylogenomic studies due to their high computational complexity. Hence alignment-free methods became popular in recent years. Here we propose a fast alignment-free method for whole genome/proteome comparison and phylogeny reconstruction using higher order Markov model and chaos game representation. In the present method, we use the transition matrices of higher order Markov models to characterize amino acid or DNA sequences for their comparison. The order of the Markov model is uniquely identified by maximizing the average Shannon entropy of conditional probability distributions. Using one-dimensional chaos game representation and linked list, this method can reduce large memory and time consumption which is due to the large-scale conditional probability distributions. To illustrate the effectiveness of our method, we employ it for fast phylogeny reconstruction based on genome/proteome sequences of two species data sets used in previous published papers. Our results demonstrate that the present method is useful and efficient. AVAILABILITY AND IMPLEMENTATION:The source codes for our algorithm to get the distance matrix and genome/proteome sequences can be downloaded from ftp://1.1.1.9.20.25/. The software Phylip and EvolView we used to construct phylogenetic trees can be referred from their websites.

关键词： Alignment-free whole proteome comparison Chaos game representation Higher order Markov model Phylogenetic tree Shannon entropy

A Progressive Image Restoration Network for High-order Degradation Imaging in Remote Sensing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Feng, Yujie Yang, Yin Fan, Xiaohong Zhang, Zhengpeng Bu, Lijing Zhang, Jianping School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory for Intelligent Computing and Information Processing of the Ministry of Education Xiangtan411105 China School of Mathematics and Computational Science Xiangtan University National Center for Applied Mathematics in Hunan Hunan International Scientific and Technological Innovation Cooperation Base of Computational Science Xiangtan411105 China College of Mathematical Medicine Zhejiang Normal University Jinhua321004 China School of Automation and Electronic Information Xiangtan University Xiangtan411105 China

Recently, deep learning methods have gained remarkable achievements in the field of image restoration for remote sensing (RS). However, most existing RS image restoration methods focus mainly on conventional first-order degradation models, which may not effectively capture the imaging mechanisms of remote sensing images. Furthermore, many RS image restoration approaches that use deep learning are often criticized for their lacks of architecture transparency and model interpretability. To address these problems, we propose a novel progressive restoration network for high-order degradation imaging (HDI-PRNet), to progressively restore different image degradation. HDI-PRNet is developed based on the theoretical framework of degradation imaging, offering the benefit of mathematical interpretability within the unfolding network. The framework is composed of three main components: a module for image denoising that relies on proximal mapping prior learning, a module for image deblurring that integrates Neumann series expansion with dual-domain degradation learning, and a module for super-resolution. Extensive experiments demonstrate that our method achieves superior performance on both synthetic and real remote sensing images. Copyright © 2024, The Authors. All rights reserved.

关键词： Image reconstruction

MVMS-RCN: A Dual-Domain Unified CT Reconstruction with Multi-sparse-view and Multi-scale Refinement-correction

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Fan, Xiaohong Chen, Ke Yi, Huaming Yang, Yin Zhang, Jianping The School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan411105 China The Centre for Mathematical Imaging Techniques Department of Mathematical Sciences The University of Liverpool LiverpoolL6972L United Kingdom The School of Mathematics and Computational Science Xiangtan University Hunan National Applied Mathematics Center Xiangtan411105 China The School of Mathematics and Computational Science Xiangtan University Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan411105 China

X-ray Computed Tomography (CT) is one of the most important diagnostic imaging techniques in clinical applications. Sparse-view CT imaging reduces the number of projection views to a lower radiation dose and alleviates the potential risk of radiation exposure. Most existing deep learning (DL) and deep unfolding sparse-view CT reconstruction methods: 1. do not fully use the projection data;2) do not always link their architecture designs to a mathematical theory;3) do not flexibly deal with multi-sparse-view reconstruction assignments. This paper aims to use mathematical ideas and design optimal DL imaging algorithms for sparse-view CT reconstructions. We propose a novel dual-domain unified framework that offers a great deal of flexibility for multi-sparse-view CT reconstruction through a single model. This framework combines the theoretical advantages of model-based methods with the superior reconstruction performance of DL-based methods, resulting in the expected generalizability of DL. We propose a refinement module that utilizes unfolding projection domain to refine full-sparse-view projection errors, as well as an image domain correction module that distills multi-scale geometric error corrections to reconstruct sparse-view CT. This provides us with a new way to explore the potential of projection information and a new perspective on designing network architectures. The multi-scale geometric correction module is end-to-end learnable, and our method could function as a plug-and-play reconstruction technique, adaptable to various applications. Extensive experiments demonstrate that our framework is superior to other existing state-of-the-art methods. Our source codes are available at https://***/fanxiaohong/MVMS-RCN. Copyright © 2024, The Authors. All rights reserved.

关键词： Geometry

Nest-DGIL: Nesterov-optimized Deep Geometric Incremental Learning for CS Image Reconstruction

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Fan, Xiaohong Yang, Yin Chen, Ke Feng, Yujie Zhang, Jianping The School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan411105 China The School of Mathematics and Computational Science Xiangtan University Hunan National Applied Mathematics Center Xiangtan411105 China The Centre for Mathematical ImagingTechniques Department of Mathematical Sciences The University of Liverpool Department of Mathematics and Statistics University of Strathclyde Glasgow United Kingdom The School of Mathematics and Computational Science Xiangtan University The Key Laboratory of Intelligent Computing & Information Processing The Ministry of Education Xiangtan411105 China

Proximal gradient-based optimization is one of the most common strategies to solve inverse problem of images, and it is easy to implement. However, these techniques often generate heavy artifacts in image reconstruction. One of the most popular refinement methods is to fine-tune the regularization parameter to alleviate such artifacts, but it may not always be sufficient or applicable due to increased computational costs. In this work, we propose a deep geometric incremental learning framework based on the second Nesterov proximal gradient optimization. The proposed end-to-end network not only has the powerful learning ability for high-/low-frequency image features, but also can theoretically guarantee that geometric texture details will be reconstructed from preliminary linear reconstruction. Furthermore, it can avoid the risk of intermediate reconstruction results falling outside the geometric decomposition domains and achieve fast convergence. Our reconstruction framework is decomposed into four modules including general linear reconstruction, cascade geometric incremental restoration, Nesterov acceleration, and post-processing. In the image restoration step, a cascade geometric incremental learning module is designed to compensate for missing texture information from different geometric spectral decomposition domains. Inspired by the overlap-tile strategy, we also develop a post-processing module to remove the block effect in patch-wise-based natural image reconstruction. All parameters in the proposed model are learnable, an adaptive initialization technique of physical parameters is also employed to make model flexibility and ensure converging smoothly. We compare the reconstruction performance of the proposed method with existing state-of-the-art methods to demonstrate its superiority. Our source codes are available at https://***/fanxiaohong/Nest-DGIL. Copyright © 2023, The Authors. All rights reserved.

关键词： Image reconstruction

A directed continuous time random walk model with jump length depending on waiting time

学校读者我要写书评

暂无评论

The Scientific World Journal

The Scientific World Journal 2014年第1期2014卷 182508页

作者： Shi, Long Yu, Zuguo Mao, Zhi Xiao, Aiguo Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China Institute of Mathematics and Physics Central South University of Forest and Technology Changsha Hunan 410004 China School of Mathematical Sciences Queensland University of Technology Brisbane QLD 4001 G.P.O. Box 2434 Australia

In continuum one-dimensional space, a coupled directed continuous time random walk model is proposed, where the random walker jumps toward one direction and the waiting time between jumps affects the subsequent jump. In the proposed model, the Laplace-Laplace transform of the probability density function P (x, t) of finding the walker at position x at time t is completely determined by the Laplace transform of the probability density function (t) of the waiting time. In terms of the probability density function of the waiting time in the Laplace domain, the limit distribution of the random process and the corresponding evolving equations are derived. © 201. Long Shi et al.

关键词：

Multicontinuum Homogenization for Coupled Flow and Transport Equations

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ammosov, Dmitry Leung, W.T. Shan, Buzheng Huang, Jian Computational Technologies & Artificial Intelligence North-Eastern Federal University Yakutsk677980 Russia Department of Mathematics City University of Hong Kong Hong Kong Department of Mathematics Texas A&M University College StationTX77843 United States School of Mathematics and Computational Science Xiangtan University National Center for Applied Mathematics in Hunan Hunan Key Laboratory for Computation and Simulation in Science and Engineering Hunan Xiangtan411105 China

In this paper, we present the derivation of a multicontinuum model for the coupled flow and transport equations by applying multicontinuum homogenization. We perform the multicontinuum expansion for both flow and transport solutions and formulate novel coupled constraint cell problems to capture the multiscale property, where oversampled regions are utilized to avoid boundary effects. Assuming the smoothness of macroscopic variables, we obtain a multicontinuum system composed of macroscopic elliptic equations and convection-diffusion-reaction equations with homogenized effective properties. Finally, we present numerical results for various coefficient fields and boundary conditions to validate our proposed algorithm. Copyright © 2024, The Authors. All rights reserved.

关键词：