polynomial_ruby 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: ede8e6a2d4872e82ed9420dba9999982f7b2bdf0
-  data.tar.gz: 4a8cfd3389646661d05835da4521994c2db5bd47
+  metadata.gz: 48b49a2e557f6ef07603be79938c3db1c7ab32f9
+  data.tar.gz: 89adc427db8cd3e577ce8a2f61829158c7edf7ff
 SHA512:
-  metadata.gz: 007579b12f730d09b829d0569e0794cf3b72f7f1c3eeaf3444d998e8b398573bd6b9e0bfe864b5b0b71695d97239fd7feb6c70b93305d963d436f65a179aa824
-  data.tar.gz: 317489f4926659f54b9a88567fa5c77207318b87b06b8541b7f4256d5574a0feb66e2616d27160207141053c3ba86bfe1b2f440ad4b23d8eaf32db54d6588b24
+  metadata.gz: ae58ef386017a81c234906c7fd9624ad8f289aef6f90ab31ff82b367b73f69375858f6037e3bcad19125aa168415bf690463ff53599ea230f8df0c3160ab33e0
+  data.tar.gz: 2bc1b11d18736ed4dc53fd539dbb50a7361245b43bd6f51af6a52e09a45cb3ed69a2f34c87716a50dcab07b20d80700876c775a4b708b35cbf72c6820e1e7b3a

data/lib/polynomial_ruby.rb

@@ -1,5 +1,8 @@
 require "polynomial_ruby/version"
-
-module PolynomialRuby
-  # Your code goes here...
-end
+require 'bigdecimal'
+require 'polynomial_ruby/polynomial'
+require 'polynomial_ruby/interpolation'
+require 'polynomial_ruby/interpolation_algorithm'
+require 'polynomial_ruby/lagrange_algorithm'
+require 'polynomial_ruby/lagrange_polynomial'
+require 'polynomial_ruby/neville_algorithm'

data/lib/polynomial_ruby/interpolation.rb

@@ -0,0 +1,18 @@
+require 'scanf'
+require 'bigdecimal'
+
+points_count = scanf("%d")[0]
+points = Array.new(points_count) {
+  scan = scanf("%s%s")
+  [BigDecimal(scan[0]), BigDecimal(scan[1])]
+}
+
+point = BigDecimal(scanf("%s")[0])
+
+lagrange_polynomial = LagrangePolynomial.new(points).call
+lagrange_solution   = LagrangeAlgorithm.new(points).call(point)
+neville_solution    = NevilleAlgorithm.new(points).call(point)
+
+puts "Lagrange polynomial: #{lagrange_polynomial}"
+puts "Lagrange algorithm solution for #{point}: #{lagrange_solution}"
+puts "Neville algorithm solution for #{point}: #{neville_solution}"

data/lib/polynomial_ruby/interpolation_algorithm.rb

@@ -0,0 +1,12 @@
+class InterpolationAlgorithm
+  attr_accessor :points, :values
+
+  def initialize(input)
+    self.points = input.map { |a, _| a }
+    self.values = input.map { |_, b| b }
+  end
+
+  def call(point)
+    raise NotImplementedError, "Implement #call in #{self.class}"
+  end
+end

data/lib/polynomial_ruby/lagrange_algorithm.rb

@@ -0,0 +1,23 @@
+class LagrangeAlgorithm < InterpolationAlgorithm
+  def call(point)
+    basis_polynomials(point).zip(values)
+                     .map { |p, v| p * v }
+                     .reduce(:+)
+  end
+
+  private
+
+  def basis_polynomials(point)
+    Array.new(points.size) { |j|
+      numerator = BigDecimal(1)
+      denominator = BigDecimal(1)
+      points.each_with_index { |el, m|
+        numerator *= (point - points[m]) unless(j == m)
+      }
+      points.each_with_index { |el, m|
+        denominator *= (points[j] - points[m]) unless(j == m)
+      }
+      numerator / denominator
+    }
+  end
+end

data/lib/polynomial_ruby/lagrange_polynomial.rb

@@ -0,0 +1,31 @@
+class LagrangePolynomial
+  attr_accessor :points, :values
+
+  def initialize(input)
+    self.points = input.map { |a, _| a }
+    self.values = input.map { |_, b| b }
+  end
+
+  def call
+    basis_polynomials.zip(values)
+                     .map { |p, v| p * v }
+                     .reduce(:+)
+  end
+
+  private
+
+  def basis_polynomials
+    Array.new(points.size) { |j|
+      numerator = Polynomial.new([BigDecimal(1)])
+      denominator = BigDecimal(1)
+      points.each_with_index { |el, m|
+        numerator *= Polynomial.new([BigDecimal(0), BigDecimal(1)]) - el unless(j == m)
+      }
+      points.each_with_index { |el, m|
+        denominator *= (points[j] - points[m]) unless(j == m)
+      }
+      numerator / denominator
+    }
+  end
+end
+

data/lib/polynomial_ruby/neville_algorithm.rb

@@ -0,0 +1,32 @@
+class NevilleAlgorithm < InterpolationAlgorithm
+  def call(point)
+    Solution.new(points, values, point).call
+  end
+
+  private
+
+  Solution = Struct.new(:points, :values, :point) do
+    def call
+      at(0, size)
+    end
+
+    private
+
+    def at(i, j)
+      @at ||= {}
+      @at.fetch([i, j]) {
+        value = if i == j
+          values[i]
+        else
+          ((points[j]-point)*at(i, j-1)+(point-points[i])*at(i+1,j))/(points[j]-points[i])
+        end
+        @at[[i, j]] = value
+        value
+      }
+    end
+
+    def size
+      points.size - 1
+    end
+  end
+end

data/lib/polynomial_ruby/polynomial.rb

@@ -0,0 +1,79 @@
+require 'bigdecimal'
+
+class Polynomial
+
+    attr_reader :coefficients
+
+    def initialize(coefficients)
+      raise "At least one coefficient is required" if coefficients.size == 0
+      coefficients = coefficients[0...-1] while coefficients[-1] == 0 && coefficients.size > 1
+      @coefficients = Array(coefficients)
+    end
+
+    def degree
+      coefficients.size - 1
+    end
+
+    def +(other)
+      if other.kind_of?(Numeric)
+        self + self.class.new([other])
+      elsif other.kind_of?(self.class)
+        coef = Array.new([other.degree, degree].max + 1) { |i|
+          (other.coefficients[i] || 0) + (coefficients[i] || 0)
+        }
+        self.class.new(coef)
+      else
+        raise "Cannot sum #{self} with #{other}"
+      end
+    end
+
+    def *(other)
+      if other.kind_of?(Numeric)
+        self.class.new(coefficients.map { |c| c * other })
+      elsif other.kind_of?(self.class)
+        coefficients.map.with_index { |c, idx|
+          self.class.new(Array.new(idx, 0) + other.coefficients.map { |o| o * c })
+        }.reduce { |sum, p|
+          sum + p
+        }
+      else
+        raise "Cannot multiply #{self} by #{other}"
+      end
+    end
+
+    def -(other)
+      self + (other * -1)
+    end
+
+    def /(other)
+      if (other.kind_of?(Numeric))
+        Polynomial.new(coefficients.map { |c| c / other })
+      else
+        raise "cannot divide #{self} by #{other}"
+      end
+    end
+
+    def ==(other)
+      if (other.kind_of?(self.class))
+        coefficients == other.coefficients
+      else
+        super
+      end
+    end
+
+    def to_s
+      coefficients[1..-1].reverse.map.with_index { |c, i|
+        sign = if (i != 0)
+                 if (c > 0) then
+                   "+"
+                 end
+               end
+        [sign, "#{c}x^#{degree-i}"].join unless c == 0
+      }.push(coefficients[0] != 0 ? "+ #{coefficients[0]}" : nil).compact.join
+    end
+
+    def inspect
+      "#<Polynomial: #{to_s} >"
+    end
+
+end

data/lib/polynomial_ruby/version.rb

@@ -1,3 +1,3 @@
 module PolynomialRuby
-  VERSION = "0.0.1"
+  VERSION = "0.0.2"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: polynomial_ruby
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Dustin Zeisler
@@ -53,21 +53,23 @@ dependencies:
       - !ruby/object:Gem::Version
         version: '2.14'
 description: Forked from https://github.com/pewniak747/polynomial-ruby and made into
-  a gem
+  a gem.
 email:
 - dustin@zive.me
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- ".gitignore"
-- Gemfile
 - LICENSE.txt
 - README.md
-- Rakefile
 - lib/polynomial_ruby.rb
+- lib/polynomial_ruby/interpolation.rb
+- lib/polynomial_ruby/interpolation_algorithm.rb
+- lib/polynomial_ruby/lagrange_algorithm.rb
+- lib/polynomial_ruby/lagrange_polynomial.rb
+- lib/polynomial_ruby/neville_algorithm.rb
+- lib/polynomial_ruby/polynomial.rb
 - lib/polynomial_ruby/version.rb
-- polynomial_ruby.gemspec
 homepage: https://github.com/zeislre/polynomial-ruby
 licenses:
 - MIT

data/.gitignore

@@ -1,22 +0,0 @@
-*.gem
-*.rbc
-.bundle
-.config
-.yardoc
-Gemfile.lock
-InstalledFiles
-_yardoc
-coverage
-doc/
-lib/bundler/man
-pkg
-rdoc
-spec/reports
-test/tmp
-test/version_tmp
-tmp
-*.bundle
-*.so
-*.o
-*.a
-mkmf.log

data/Gemfile

@@ -1,4 +0,0 @@
-source 'https://rubygems.org'
-
-# Specify your gem's dependencies in polynomial_ruby.gemspec
-gemspec

data/Rakefile

@@ -1,2 +0,0 @@
-require "bundler/gem_tasks"
-

data/polynomial_ruby.gemspec

@@ -1,24 +0,0 @@
-# coding: utf-8
-lib = File.expand_path('../lib', __FILE__)
-$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
-require 'polynomial_ruby/version'
-
-Gem::Specification.new do |spec|
-  spec.name          = "polynomial_ruby"
-  spec.version       = PolynomialRuby::VERSION
-  spec.authors       = ["Dustin Zeisler"]
-  spec.email         = ["dustin@zive.me"]
-  spec.summary       = %q{Forked from https://github.com/pewniak747/polynomial-ruby and made into a gem}
-  spec.description   = %q{Forked from https://github.com/pewniak747/polynomial-ruby and made into a gem}
-  spec.homepage      = "https://github.com/zeislre/polynomial-ruby"
-  spec.license       = "MIT"
-
-  spec.files         = `git ls-files -z`.split("\x0")
-  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
-  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
-  spec.require_paths = ["lib"]
-
-  spec.add_development_dependency "bundler", "~> 1.6"
-  spec.add_development_dependency "rake", "10.3"
-  spec.add_development_dependency "rspec", "2.14"
-end