Journal of Computational and Applied Mathematics最新文献

筛选
英文 中文
Approximation capabilities of certain nonlinear neural network operators 一类非线性神经网络算子的逼近能力
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-13 DOI: 10.1016/j.cam.2026.117452
Sachin Saini, Uaday Singh
{"title":"Approximation capabilities of certain nonlinear neural network operators","authors":"Sachin Saini,&nbsp;Uaday Singh","doi":"10.1016/j.cam.2026.117452","DOIUrl":"10.1016/j.cam.2026.117452","url":null,"abstract":"<div><div>In this paper, a new family of nonlinear neural network operators with a single hidden layer has been introduced for a class of continuous functions and Lebesgue integrable functions on a compact interval. We used specific activation functions constructed using a class of sigmoidal functions. The convergence of these operators is examined, and we establish both pointwise and uniform approximation theorems for the functions in the class of continuous functions <span><math><mrow><mi>C</mi><mo>(</mo><mi>I</mi><mo>)</mo></mrow></math></span>, <span><math><mrow><mi>I</mi><mo>=</mo><mo>[</mo><mi>c</mi><mo>,</mo><mi>d</mi><mo>]</mo></mrow></math></span>. We also extend the study for the class of Lebesgue integrable functions <span><math><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>I</mi><mo>)</mo></mrow></mrow></math></span> for <em>p</em> ≥ 1. Investigation of these nonlinear operators provides valuable insights into their generalization ability and practical applications in signal processing. We also discuss some examples, quantitative estimates, and graphical representations to highlight the applications.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117452"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147387182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Can symmetric positive definite (SPD) coarse spaces perform well for indefinite Helmholtz problems? 对称正定(SPD)粗空间能否很好地解决不确定亥姆霍兹问题?
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-11 DOI: 10.1016/j.cam.2026.117403
Victorita Dolean , Mark Fry , Matthias Langer
{"title":"Can symmetric positive definite (SPD) coarse spaces perform well for indefinite Helmholtz problems?","authors":"Victorita Dolean ,&nbsp;Mark Fry ,&nbsp;Matthias Langer","doi":"10.1016/j.cam.2026.117403","DOIUrl":"10.1016/j.cam.2026.117403","url":null,"abstract":"<div><div>Wave propagation problems governed by the Helmholtz equation remain among the most challenging in scientific computing, due to their indefinite nature. Domain decomposition methods with spectral coarse spaces have emerged as some of the most effective preconditioners, yet their theoretical guarantees often lag behind practical performance. In this work, we introduce and analyse the Δ<sub><em>k</em></sub>-GenEO coarse space within the two-level additive Schwarz preconditioners for heterogeneous Helmholtz problems. This is an adaptation of the Δ-GenEO coarse space. Our results sharpen the <em>k</em>-explicit conditions for GMRES convergence, reducing the restrictions on the subdomain size and eigenvalue threshold. This narrows the long-standing gap between pessimistic theory and empirical evidence, and reveals why GenEO spaces based on SPD (symmetric positive definite) eigenvalue problems remain surprisingly effective despite their apparent limitations. Numerical experiments confirm the theory, demonstrating scalability, robustness to heterogeneity for low to moderate frequencies (while experiencing limitations in the high frequency cases), and significantly milder coarse-space growth than conservative estimates predict.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117403"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147387185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On reducibility of ADMM based on degenerate proximal point analysis 基于退化近端点分析的ADMM可约性研究
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-27 DOI: 10.1016/j.cam.2026.117531
Feng Xue
{"title":"On reducibility of ADMM based on degenerate proximal point analysis","authors":"Feng Xue","doi":"10.1016/j.cam.2026.117531","DOIUrl":"10.1016/j.cam.2026.117531","url":null,"abstract":"<div><div>We discuss the possibility of reducing the alternating direction method of multipliers (ADMM) to a simple resolvent form, based on a degenerate proximal point algorithm (PPA). In particular, we reformulate ADMM as a standard PPA without correction step, where the variable metric helps to identify and remove the redundant variables. This approach can be a general routine for the degeneracy reduction of any splitting algorithms.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117531"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A new strong equilibrium of multi-leader-multi-follower games: Characterization and essential stability 多领导-多随从博弈的一种新的强均衡:特征和本质稳定性
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-24 DOI: 10.1016/j.cam.2026.117524
Yunbing Li , Wensheng Jia , Shuwen Xiang
{"title":"A new strong equilibrium of multi-leader-multi-follower games: Characterization and essential stability","authors":"Yunbing Li ,&nbsp;Wensheng Jia ,&nbsp;Shuwen Xiang","doi":"10.1016/j.cam.2026.117524","DOIUrl":"10.1016/j.cam.2026.117524","url":null,"abstract":"<div><div>Under the incentives of Nessah and Tian (2014) and Yang and Ju (2016), our study aims to investigate the existence and stability of strong equilibria in multi-leader-multi-follower games (MLMFGs) and multiobjective multi-leader-multi-follower games (MMLMFGs) under appropriate assumptions. Initially, we introduce the concepts of strong equilibria in both types of games, establishing their existence results by using Fan-Browder Theorem. Furthermore, we present a method for identifying strong equilibria in MLMFGs by providing a necessary and sufficient condition, and validate the approach through an illustrative example. In addition, we define a space for multiobjective multi-leader-multi-follower games that satisfies specific conditions, and then utilize Fort’s theorem to verify that the games within a dense residual set are essential relative to this space. Finally, we establish the existence of an essential component within the set of strong equilibrium solutions by examining the connectivity of minimal essential subset of the strong equilibrium solution set.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117524"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A transported PDF modeling method applied to one-dimensional stochastic Burgers equation 一种用于一维随机Burgers方程的传输PDF建模方法
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-20 DOI: 10.1016/j.cam.2026.117464
Yize Wang , Li Yuan
{"title":"A transported PDF modeling method applied to one-dimensional stochastic Burgers equation","authors":"Yize Wang ,&nbsp;Li Yuan","doi":"10.1016/j.cam.2026.117464","DOIUrl":"10.1016/j.cam.2026.117464","url":null,"abstract":"<div><div>In this paper we apply the transported probability density function (PDF) method to model the Burgers turbulence governed by the one-dimensional Burgers equation with a stochastic external force and random initial data. The PDF modeling method can provide the mean and high order moments of the random solution variable which are useful for the characterization of Burgers turbulence. Firstly, an exact one-point PDF transport equation is derived from the Burgers equation with a stochastic external force, and then the conditional advection and diffusion terms are modeled for closure by using two respective models. Secondly, three numerical methods are employed to solve the modeled PDF transport equation: the mesh-based Lagrangian particle Monte Carlo (MC) method, the original quadrature method of moments (QMOM), and the linear QMOM (LQMOM) as modified in this work. The numerical tests verify the viability of using the PDF modeling method to study Burgers turbulence and show that the MC method, LQMOM and QMOM can yield results comparable to the DNS solution, and the LQMOM is more efficient than the QMOM and MC method. However, the MC method has less dissipation for turbulence in high wavenumber regimes.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117464"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147387128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Existence and continuity theorems of equilibrium solutions of multi-objective leader-follower games with fuzzy payoffs 具有模糊收益的多目标leader-follower博弈均衡解的存在性和连续性定理
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-24 DOI: 10.1016/j.cam.2026.117518
Li Zhou , Wensheng Jia
{"title":"Existence and continuity theorems of equilibrium solutions of multi-objective leader-follower games with fuzzy payoffs","authors":"Li Zhou ,&nbsp;Wensheng Jia","doi":"10.1016/j.cam.2026.117518","DOIUrl":"10.1016/j.cam.2026.117518","url":null,"abstract":"<div><div>Under the assumption that the payoffs of players are fuzzy-valued vector functions, we prove the existence and stability of fuzzy equilibria for multi-objective leader-follower games. To begin with, based on the order relation of fuzzy vectors, we define the notions of continuity and properly quasi-concavity of fuzzy-valued vector functions. We then propose the concept of fuzzy equilibria for fuzzy multi-objective games and prove their existence by utilizing Fan-Glicksberg fixed point theorem. Subsequently, the existence results of fuzzy equilibria for fuzzy multi-objective single-leader-multi-follower games and fuzzy multi-objective multi-leader-follower games are respectively shown. Finally, by constructing a problem space of fuzzy multi-objective multi-leader-follower games, we show that most of the games are essential in the sense of Baire category. Several examples are provided to illustrate and support the developed results.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117518"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Image recovery via modified Dai-Kou method for constrained system of nonlinear equations 基于改进Dai-Kou法的约束非线性方程组图像恢复
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-24 DOI: 10.1016/j.cam.2026.117537
Kabiru Ahmed , Mohammed Yusuf Waziri , Abubakar Sani Halilu , Salisu Murtala
{"title":"Image recovery via modified Dai-Kou method for constrained system of nonlinear equations","authors":"Kabiru Ahmed ,&nbsp;Mohammed Yusuf Waziri ,&nbsp;Abubakar Sani Halilu ,&nbsp;Salisu Murtala","doi":"10.1016/j.cam.2026.117537","DOIUrl":"10.1016/j.cam.2026.117537","url":null,"abstract":"<div><div>In this paper, a modified version of the method by Dai and Kou for unconstrained optimization is presented for solving constrained nonlinear system of equations with applications to blurry image recovery. To develop the scheme, an effective choice for the Dai-Kou parameter <em>τ<sub>k</sub></em>, which has been declared a subject of research, was obtained by conducting singular value analysis and minimizing upper bound of the condition number of the search direction matrix of the classical Dai-Kou scheme. The backtracking linesearch presented by Li and Li is used to obtain step-size in the algorithm. The scheme satisfies the vital condition for analyzing global convergence. It is also suitable for solving some large-scale nonsmooth problems since it avoids computing the Jacobian. Mild conditions are employed to prove the schemes’ global convergence, while numerical experiments with related methods are carried out to illustrate its effectiveness for solving constrained nonlinear system of equations. The method was also tested with two effective schemes in the literature to illustrate its effectiveness in image de-blurring problems.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117537"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147387001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Smooth-like lower order penalty approach for solving second-order cone mixed complementarity problems 求解二阶锥混合互补问题的光滑低阶惩罚方法
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-24 DOI: 10.1016/j.cam.2026.117513
Zijun Hao , Qiong Wu, Chunmin Zhao
{"title":"Smooth-like lower order penalty approach for solving second-order cone mixed complementarity problems","authors":"Zijun Hao ,&nbsp;Qiong Wu,&nbsp;Chunmin Zhao","doi":"10.1016/j.cam.2026.117513","DOIUrl":"10.1016/j.cam.2026.117513","url":null,"abstract":"<div><div>In this paper, a smooth-like lower order penalty approach is proposed for solving second-order cone mixed complementarity problems (SOCMCPs), which is closely related to second-order cone programming. Four kinds of special smoothing functions are considered in this approach. In light of this approach, the SOCMCP is approximated by asymptotic smooth-like lower order penalty equations (SLOPEs) with penalty parameter and smoothing parameter. Under a mild assumption, the main result shows that the solution sequence of the asymptotic SLOPEs converges exponentially to the solution of the SOCMCP while the penalty parameter tends to positive infinity and the smoothing parameter monotonically decreases to zero. A corresponding algorithm is constructed and the numerical experimental results are reported to illustrate the feasibility of the proposed algorithm. The performance profile of four specific smoothing functions is presented, and the numerical performance comparison of the proposed approach with other three algorithms is also investigated.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117513"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147387004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Machine learning analysis of thermal and solutal transport rates for Eyring-Powell magneto-nanomaterial model (EPMNM) Eyring-Powell磁纳米材料模型(EPMNM)热输运率和溶质输运率的机器学习分析
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-08 DOI: 10.1016/j.cam.2026.117417
Sana Jabeen , Muhammad , Masood Khan , Syed Modassir Hussain
{"title":"Machine learning analysis of thermal and solutal transport rates for Eyring-Powell magneto-nanomaterial model (EPMNM)","authors":"Sana Jabeen ,&nbsp;Muhammad ,&nbsp;Masood Khan ,&nbsp;Syed Modassir Hussain","doi":"10.1016/j.cam.2026.117417","DOIUrl":"10.1016/j.cam.2026.117417","url":null,"abstract":"<div><div>Artificial intelligence (AI), a revolutionary force in modern scientific research across various domains, has the potential to provide new solutions for highly complex and challenging physical models. This paper investigates the incompressible flow of an Eyring-Powell magneto-nanofluid model (EPMNM) over a stretching surface. The effects of thermal and solutal mechanisms are analyzed by incorporating variable thermal conductivity, mass diffusivity, chemical reactions, and heat sources. The Buongiorno model is employed to capture the influence of nanofluids through thermophoresis and Brownian motion. The relevant transformations convert the governing PDEs into coupled nonlinear ODEs. The numerical solution is obtained using the fourth-order Runge-Kutta-Fehlberg method in conjunction with the shooting technique. Furthermore, the Levenberg-Marquardt Neural Network Algorithm (LMNNA) is employed in an intelligent, ANN-based numerically validated solver to analyze the resulting fluid model. The BVP4C approach generated a chart displaying the behavior of the friction drag, Local Motile Density Number (LMDN), thermal, and solutal transportation rates. A dataset for various scenarios of the intriguing and comprehensive nanofluid model has been produced by exploiting BVP4C. The strengths of the machine learning analysis using LMNNA are then investigated through physical quantities such as SFC, LNN, LSHN, and LMDN. Datasets comprising 60 and 45 outcomes are categorized into three groups: training (70%), validation (15%), and testing (15%). The hidden layer consists of ten neurons. Tables 4 through 7 present the ANN predictions alongside the numerical values for SFC, LNN, LSHN, and LMDN. The accuracy of the developed neural network for these physical quantities is assessed using regression analysis and mean squared error.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117417"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147387118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Extended block Krylov subspace approaches for solving large-scale linear system of fractional DEs 求解分数阶微分方程大规模线性系统的扩展块Krylov子空间方法
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-14 DOI: 10.1016/j.cam.2026.117455
Lakhlifa Sadek , Hamad Talibi Alaoui , Ahmad Sami Bataineh , Ishak Hashim
{"title":"Extended block Krylov subspace approaches for solving large-scale linear system of fractional DEs","authors":"Lakhlifa Sadek ,&nbsp;Hamad Talibi Alaoui ,&nbsp;Ahmad Sami Bataineh ,&nbsp;Ishak Hashim","doi":"10.1016/j.cam.2026.117455","DOIUrl":"10.1016/j.cam.2026.117455","url":null,"abstract":"<div><div>This study addresses the numerical solution of large-scale linear systems of fractional differential equations (LSFDEs) featuring a low-rank constant term a class of problems not previously investigated in the literature. We propose two novel numerical approaches for solving such systems. The first method exploits the integral representation of the exact solution and employs a Krylov-based approximation to compute the action of the matrix Mittag–Leffler function on a block of vectors. The second approach projects the original high-dimensional fractional system onto an extended block Krylov subspace, reducing it to a significantly smaller fractional differential system. This reduced system is then solved using either a tailored implementation of the Grünwald-Letnikov scheme or a fractional backward differentiation formula, both adapted to the projected setting. The resulting low-rank approximate solution is iteratively refined by expanding the projection subspace until a prescribed tolerance is achieved. We derive explicit expressions for the residual and error norms and establish associated convergence estimates. To validate the computational efficiency and accuracy of the proposed methods, we conduct extensive numerical experiments on several benchmark problems. The results demonstrate that our approaches substantially reduce computational time while maintaining high numerical precision, outperforming existing conventional solvers for large-scale fractional systems.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117455"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147387124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书