Qiyao Peng

h-index8
2papers
214citations

2 Papers

9.7NAMar 12
Convergence of the Immersed Interface Method in Linear Elasticity

Sabia Asghar, Qiyao Peng, Etelvina Javierre et al.

We consider an open, bounded, simply connected (Lipschitz) domain in $\mathbb{R}^d$, which contains a closed polyhedral surface or polygonal contour, referred to as the interface. From this interface, forces are exerted in the normal direction. The forces are continuously distributed over the interface, resulting in an integral expression. This features an important characteristic of the immersed interface method. Since the integral cannot be resolved exactly, one relies on numerical quadrature rules to approximate the integral. Therefore, we consider two different linear elasticity problems with forces over a curve or surface (interface) that is located within the (open) domain of computation: (1) The force is defined by an integral over the interface; (2) The force is defined by a quadrature approximation of the integral over the interface. We prove that the ${\bf L}^2$-norm of the difference between the solutions from the two elasticity problems is of the same order as the error of quadrature. The results are demonstrated for both bounded and unbounded domains. The proof that we establish relies on the use of: (i) fundamental solutions for linear elasticity, exhibiting singular behaviors (in particular around points of action) and not being in ${\bf H}^1$, and (ii) on the use of singularity removal principle and the Extended Trace Theorem. Convergence is demonstrated in the ${\bf L}^2$-norm on curves and manifolds. We show some numerical experiments on the basis of fundamental solutions with a Midpoint quadrature rule in an unbounded and a bounded domain. We note that the error that we estimate is for the exact solutions and not for finite element solutions. Hence in the numerical finite element-based simulations, the numerical results contain an additional error due to the finite element approach.

13.2CLDec 16, 2024Code
ExecRepoBench: Multi-level Executable Code Completion Evaluation

Jian Yang, Jiajun Zhang, Jiaxi Yang et al.

Code completion has become an essential tool for daily software development. Existing evaluation benchmarks often employ static methods that do not fully capture the dynamic nature of real-world coding environments and face significant challenges, including limited context length, reliance on superficial evaluation metrics, and potential overfitting to training datasets. In this work, we introduce a novel framework for enhancing code completion in software development through the creation of a repository-level benchmark ExecRepoBench and the instruction corpora Repo-Instruct, aim at improving the functionality of open-source large language models (LLMs) in real-world coding scenarios that involve complex interdependencies across multiple files. ExecRepoBench includes 1.2K samples from active Python repositories. Plus, we present a multi-level grammar-based completion methodology conditioned on the abstract syntax tree to mask code fragments at various logical units (e.g. statements, expressions, and functions). Then, we fine-tune the open-source LLM with 7B parameters on Repo-Instruct to produce a strong code completion baseline model Qwen2.5-Coder-Instruct-C based on the open-source model. Qwen2.5-Coder-Instruct-C is rigorously evaluated against existing benchmarks, including MultiPL-E and ExecRepoBench, which consistently outperforms prior baselines across all programming languages. The deployment of \ourmethod{} can be used as a high-performance, local service for programming development\footnote{\url{https://execrepobench.github.io/}}.