arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1206.1971cs.NE
收藏

求解丢番图方程数值解的联结网络方法

A Connectionist Network Approach to Find Numerical Solutions of Diophantine Equations

Siby Abraham, Sugata Sanyal, Mukund Sanglikar

摘要:

本文介绍了一个连接网络的方法来寻找丢番图方程的数值解,试图解决著名的希尔伯特第十问题。提出的方法使用一个三层前馈神经网络与反向传播作为顺序学习过程,找到一类丢番图方程的数值解。它使用动态构造的网络架构,其中输入层中的节点数量是根据方程中变量的数量来选择的。给定丢番图方程的幂被作为输入层的输入。网络的训练从初始随机积分权重开始。基于输出层处的误差值的反向传播来更新权重。通过在网络中添加动量因子来增强权重的优化。输入层和隐层之间的连接的优化权重被视为给定的丢番图方程的数值解。使用不同数量的变量和不同的功率的不同丢番图方程的程序进行验证。

英文摘要:

The paper introduces a connectionist network approach to find numerical solutions of Diophantine equations as an attempt to address the famous Hilbert's tenth problem. The proposed methodology uses a three layer feed forward neural network with back propagation as sequential learning procedure to find numerical solutions of a class of Diophantine equations. It uses a dynamically constructed network architecture where number of nodes in the input layer is chosen based on the number of variables in the equation. The powers of the given Diophantine equation are taken as input to the input layer. The training of the network starts with initial random integral weights. The weights are updated based on the back propagation of the error values at the output layer. The optimization of weights is augmented by adding a momentum factor into the network. The optimized weights of the connection between the input layer and the hidden layer are taken as numerical solution of the given Diophantine equation. The procedure is validated using different Diophantine Equations of different number of variables and different powers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑