发布求助
文献互助 智能选刊 最新文献

Japan Journal of Industrial and Applied Mathematics最新文献

筛选
英文 中文
Decomposition of an integrally convex set into a Minkowski sum of bounded and conic integrally convex sets 将积分凸集分解为有界和圆锥积分凸集的闵科夫斯基和
IF 0.9 4区 数学
Japan Journal of Industrial and Applied Mathematics Pub Date : 2023-12-16 DOI: 10.1007/s13160-023-00635-1
Kazuo Murota, Akihisa Tamura
{"title":"Decomposition of an integrally convex set into a Minkowski sum of bounded and conic integrally convex sets","authors":"Kazuo Murota, Akihisa Tamura","doi":"10.1007/s13160-023-00635-1","DOIUrl":"https://doi.org/10.1007/s13160-023-00635-1","url":null,"abstract":"<p>Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as integrally convex sets, <span>(hbox {L}^{natural })</span>-convex sets, and <span>(hbox {M}^{natural })</span>-convex sets.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"2 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138685637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improving the Gauss–Seidel iterative method for solving multi-linear systems with $$mathcal {M}$$ -tensors 改进解决具有 $$mathcal {M}$ - 张量的多线性系统的高斯-赛德尔迭代法
IF 0.9 4区 数学
Japan Journal of Industrial and Applied Mathematics Pub Date : 2023-12-14 DOI: 10.1007/s13160-023-00637-z
Malihe Nobakht-Kooshkghazi, Mehdi Najafi-Kalyani
{"title":"Improving the Gauss–Seidel iterative method for solving multi-linear systems with $$mathcal {M}$$ -tensors","authors":"Malihe Nobakht-Kooshkghazi, Mehdi Najafi-Kalyani","doi":"10.1007/s13160-023-00637-z","DOIUrl":"https://doi.org/10.1007/s13160-023-00637-z","url":null,"abstract":"<p>The main objective of this paper is to solve multi-linear systems with strong <span>( mathcal {M})</span>-tensors using preconditioned methods based on tensor splitting. In this paper, we propose a new preconditioned Gauss–Seidel iterative method for solving multi-linear systems. The convergence and comparison theorems of the proposed method are discussed. Finally, some numerical experiments are given to confirm our theoretical analysis and demonstrate the efficiency of the proposed method.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"7 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138685629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computing interior eigenpairs in augmented Krylov subspace produced by Jacobi–Davidson correction equation 计算雅各比-戴维森修正方程产生的增强克雷洛夫子空间中的内部特征对
IF 0.9 4区 数学
Japan Journal of Industrial and Applied Mathematics Pub Date : 2023-12-11 DOI: 10.1007/s13160-023-00636-0
Kang-Ya Lu, Cun-Qiang Miao
{"title":"Computing interior eigenpairs in augmented Krylov subspace produced by Jacobi–Davidson correction equation","authors":"Kang-Ya Lu, Cun-Qiang Miao","doi":"10.1007/s13160-023-00636-0","DOIUrl":"https://doi.org/10.1007/s13160-023-00636-0","url":null,"abstract":"<p>As we know, the Jacobi–Davidson iteration method is very efficient for computing both extreme and interior eigenvalues of standard eigenvalue problems. However, the involved Jacobi–Davidson correction equation and the harmonic Rayleigh–Ritz process are more complicated and costly for computing the interior eigenvalues than those for computing the extreme eigenvalues. Thus, in this paper we adopt the originally elegant correction equation to generate the projection subspace in a skillful way, which is used to extract the desired eigenpair by the harmonic Rayleigh–Ritz process. The projection subspace, called as augmented Krylov subspace, inherits the benefits from both the standard Krylov subspace and the Jacobi–Davidson correction equation, which results in the constructed augmented Krylov subspace method being more effective than the Jacobi–Davidson method. A few numerical experiments are executed to exhibit the convergence and the competitiveness of the method.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"14 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138567834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Note on minimization of quasi M$$^{natural }$$-convex functions 准 M$^{natural }$$ 凸函数的最小化说明
IF 0.9 4区 数学
Japan Journal of Industrial and Applied Mathematics Pub Date : 2023-12-08 DOI: 10.1007/s13160-023-00633-3
Kazuo Murota, A. Shioura
{"title":"Note on minimization of quasi M$$^{natural }$$-convex functions","authors":"Kazuo Murota, A. Shioura","doi":"10.1007/s13160-023-00633-3","DOIUrl":"https://doi.org/10.1007/s13160-023-00633-3","url":null,"abstract":"","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"24 9","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138589269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exact penalty method for knot selection of B-spline regression b样条回归中结点选择的精确惩罚方法
IF 0.9 4区 数学
Japan Journal of Industrial and Applied Mathematics Pub Date : 2023-12-03 DOI: 10.1007/s13160-023-00631-5
Shotaro Yagishita, Jun-ya Gotoh
{"title":"Exact penalty method for knot selection of B-spline regression","authors":"Shotaro Yagishita, Jun-ya Gotoh","doi":"10.1007/s13160-023-00631-5","DOIUrl":"https://doi.org/10.1007/s13160-023-00631-5","url":null,"abstract":"<p>This paper presents a new approach to selecting knots at the same time as estimating the B-spline regression model. Such simultaneous selection of knots and model is not trivial, but our strategy can make it possible by employing a nonconvex regularization on the least square method that is usually applied. More specifically, motivated by the constraint that directly designates (the upper bound of) the number of knots to be used, we present an (unconstrained) regularized least square reformulation, which is later shown to be equivalent to the motivating cardinality-constrained formulation. The obtained formulation is further modified so that we can employ a proximal gradient-type algorithm, known as GIST, for a class of nonconvex nonsmooth optimization problems. We show that under a mild technical assumption, the algorithm is shown to reach a local minimum of the problem. Since it is shown that any local minimum of the problem satisfies the cardinality constraint, the proposed algorithm can be used to obtain a spline regression model that depends only on a designated number of knots at most. Numerical experiments demonstrate how our approach performs on synthetic and real data sets.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"13 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138518774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A polynomial interior-point algorithm with improved iteration bounds for linear optimization 线性优化的改进迭代界多项式内点算法
IF 0.9 4区 数学
Japan Journal of Industrial and Applied Mathematics Pub Date : 2023-12-01 DOI: 10.1007/s13160-023-00630-6
Liying Liu, Tao Hua
{"title":"A polynomial interior-point algorithm with improved iteration bounds for linear optimization","authors":"Liying Liu, Tao Hua","doi":"10.1007/s13160-023-00630-6","DOIUrl":"https://doi.org/10.1007/s13160-023-00630-6","url":null,"abstract":"<p>In this paper, we present a polynomial primal-dual interior-point algorithm for linear optimization based on a modified logarithmic barrier kernel function. Iteration bounds for the large-update interior-point method and the small-update interior-point method are derived. It is shown that the large-update interior-point method has the same polynomial complexity as the small-update interior-point method, which is the best known iteration bounds. Our result closes a long-existing gap in the theoretical complexity bounds for large-update interior-point method and small-update interior-point method.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"3 ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138518790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Time changes of customer behavior on accommodation reservation: a case study of Japan 住宿预订中顾客行为的时间变化——以日本为例
IF 0.9 4区 数学
Japan Journal of Industrial and Applied Mathematics Pub Date : 2023-11-28 DOI: 10.1007/s13160-023-00623-5
Koichi Ito, Shunsuke Kanemitsu, Ryusuke Kimura, Ryosuke Omori
{"title":"Time changes of customer behavior on accommodation reservation: a case study of Japan","authors":"Koichi Ito, Shunsuke Kanemitsu, Ryusuke Kimura, Ryosuke Omori","doi":"10.1007/s13160-023-00623-5","DOIUrl":"https://doi.org/10.1007/s13160-023-00623-5","url":null,"abstract":"<p>The forecasting of demand or cancellations is highly important for efficient revenue management in the hotel industry. Previous studies have mainly focused on the accuracy of the prediction of reservation number or cancellation rate on a specific accommodation or hotel chain; therefore, the application of the prediction to different accommodations or under the behavioral change of customers in response to natural or human events is difficult without the re-estimation of the prediction model. Information of the customer behavioral trend on the accommodation reservations is necessary for the construction of a general forecasting model. In this study, we focus on one of the general trends of customer behavior, that is, the reservation timing and the time changes of the cancellation probability using the big data of the reservation records provided by an online trip agency in Japan. We showed that the reservation timing and cancellation probability can be decomposed by five and six exponential functions of the days until the stay and the days from the reservations. We also showed that the significant factors influencing the time changing patterns are the guest numbers per room for both reservation and cancellation, composition of guests in terms of the number and gender of guests, and the stay length for reservation. These findings imply that the customer behavior during accommodation reservation could be categorized into multiple motivational factors toward reservations or cancellations. Our results contribute to the construction of a general forecasting model on the accommodation reservations.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"49 ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138518769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improvement of selection formulas of mesh size and truncation numbers for the DE-Sinc approximation and its theoretical error bound 改进了DE-Sinc近似的网格大小和截断数选择公式及其理论误差界
IF 0.9 4区 数学
Japan Journal of Industrial and Applied Mathematics Pub Date : 2023-11-28 DOI: 10.1007/s13160-023-00634-2
Tomoaki Okayama, Shota Ogawa
{"title":"Improvement of selection formulas of mesh size and truncation numbers for the DE-Sinc approximation and its theoretical error bound","authors":"Tomoaki Okayama, Shota Ogawa","doi":"10.1007/s13160-023-00634-2","DOIUrl":"https://doi.org/10.1007/s13160-023-00634-2","url":null,"abstract":"<p>The Sinc approximation applied to double-exponentially decaying functions is referred to as the DE-Sinc approximation. Because of its high efficiency, this method has been used in various applications. In the Sinc approximation, the mesh size and truncation numbers should be optimally selected to achieve its best performance. However, the standard selection formula has only been “near-optimally” selected because the optimal formula of the mesh size cannot be expressed in terms of elementary functions of truncation numbers. In this study, we propose two improved selection formulas. The first one is based on the concept by an earlier research that resulted in a better selection formula for the double-exponential formula. The formula performs slightly better than the standard one, but is still not optimal. As a second selection formula, we introduce a new parameter to propose truly optimal selection formula. We provide explicit error bounds for both selection formulas. Numerical comparisons show that the first formula gives a better error bound than the standard formula, and the second formula gives a much better error bound than the standard and first formulas.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"491 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138518789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A linearizing-decoupling finite element method with stabilization for the Peterlin viscoelastic model Peterlin粘弹性模型的线性解耦有限元稳定化方法
IF 0.9 4区 数学
Japan Journal of Industrial and Applied Mathematics Pub Date : 2023-11-27 DOI: 10.1007/s13160-023-00629-z
Lekang Xia, Guanyu Zhou
{"title":"A linearizing-decoupling finite element method with stabilization for the Peterlin viscoelastic model","authors":"Lekang Xia, Guanyu Zhou","doi":"10.1007/s13160-023-00629-z","DOIUrl":"https://doi.org/10.1007/s13160-023-00629-z","url":null,"abstract":"<p>We propose a linearizing-decoupling finite element method for the nonstationary diffusive Peterlin viscoelastic system with shear-dependent viscosity modeling the incompressible polymeric fluid flow, where the equation of the conformation tensor <span>({varvec{C}})</span> contains a diffusion term with a tiny diffusion coefficient <span>(epsilon)</span>. By using the stabilizing terms <span>(alpha _1^{-1} Delta ({varvec{u}}^{n+1} - {varvec{u}}^{n}))</span> and <span>(alpha _2^{-1} Delta ({varvec{C}}^{n+1} - {varvec{C}}^{n}))</span>, at every time level, the velocity <span>({varvec{u}})</span> and each component <span>(C_{ij})</span> of the conformation tensor <span>({varvec{C}})</span> can be computed in parallel by our scheme. We obtain the error estimate <span>(C(tau + h^2))</span> for the P2/P1/P2 element, where the constant <i>C</i> depends on the norm of the solution but is not explicitly related to the reciprocal of <span>(epsilon)</span>. We conduct several numerical simulations and compute the experimental convergence rates to compare with the theoretical results.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"24 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138518770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sixth-order quasi-compact difference scheme for the time-dependent diffusion equation 时变扩散方程的六阶拟紧差分格式
IF 0.9 4区 数学
Japan Journal of Industrial and Applied Mathematics Pub Date : 2023-11-25 DOI: 10.1007/s13160-023-00628-0
Zhi Wang, Yongbin Ge, Hai-Wei Sun, Tao Sun
{"title":"Sixth-order quasi-compact difference scheme for the time-dependent diffusion equation","authors":"Zhi Wang, Yongbin Ge, Hai-Wei Sun, Tao Sun","doi":"10.1007/s13160-023-00628-0","DOIUrl":"https://doi.org/10.1007/s13160-023-00628-0","url":null,"abstract":"<p>This paper focuses on developing a numerical method with high-order accuracy for solving the time-dependent diffusion equation. We discrete time first, which results in a modified Helmholtz equation at each time level. Then, the quasi-compact difference method, which is derivative-free, is used to discretize the resulting Helmholtz equation. Theoretically, the stability and convergence analyses are performed by the aid of the Fourier method and error estimation, respectively. Numerically, Richardson extrapolation algorithm is utilized to improve the time accuracy, while the fast sine transformation is employed to reduce the complexity for solving the discretized linear system. Numerical examples are given to validate the accuracy and effectiveness of the proposed discretization method.</p>","PeriodicalId":50264,"journal":{"name":"Japan Journal of Industrial and Applied Mathematics","volume":"3 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138518788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"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学术文献互助群
群 号：481959085
Book学术官方微信